红肿
发表于 2025-3-23 11:14:45
http://reply.papertrans.cn/23/2300/229933/229933_11.png
祝贺
发表于 2025-3-23 15:07:30
Katherine A. Duggan,Zlatan Križano that no two adjacent vertices in H′ are of the same colour. Then any two vertices in G are connected by a hamiltonian path if and only if G contains an edge joining two blue vertices and an edge joining two red vertices. This result enables us to characterize abelian group graphs G in whichany two vertices are connected by a hamiltonian path.
丰满有漂亮
发表于 2025-3-23 20:35:48
http://reply.papertrans.cn/23/2300/229933/229933_13.png
Fresco
发表于 2025-3-23 22:23:56
http://reply.papertrans.cn/23/2300/229933/229933_14.png
含糊其辞
发表于 2025-3-24 04:02:36
http://reply.papertrans.cn/23/2300/229933/229933_15.png
Addictive
发表于 2025-3-24 09:32:06
http://reply.papertrans.cn/23/2300/229933/229933_16.png
过度
发表于 2025-3-24 14:36:08
Connected subgraphs of the graph of multigraphic realisations of a degree sequence, by taking any two vertices of ., say . and ., and finding a path between them which preserves any previously chosen edge of multiplicity . that occurs in both . and .. The construction of this path also establishes best possible upper and lower bounds on the length of the shortest path between any two vertices of ..
悲观
发表于 2025-3-24 18:21:45
Enumeration of binary phylogenetic trees,ree is meant one in which every point has degree 1 or 3. The exact and asymptotic numbers of binary phylogenetic trees are determined under the presence or absence of two additional conditions on the labelling. The optional constraints studied require nonempty label sets to be singletons, and that only endpoints be labelled.
Repatriate
发表于 2025-3-24 21:17:01
http://reply.papertrans.cn/23/2300/229933/229933_19.png
ungainly
发表于 2025-3-25 02:42:02
Lecture Notes in Mathematicshttp://image.papertrans.cn/c/image/229933.jpg