Spanning 2‐trails from degree sum conditions

DOI10.1002/jgt.10162zbMath1034.05031OpenAlexW4250788305MaRDI QIDQ4459608

Yi Zhang, Xiaoya Zha, Mark N. Ellingham

Publication date: 29 March 2004

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.10162

zbMATH Keywords

degree sumconnected even factorspanning trail

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45)

Related Items

An improved degree based condition for Hamiltonian cycles, Spanning trails with maximum degree at most 4 in \(2K_2\)-free graphs, Spanning trails in a 2-connected graph, Ore-type conditions for the existence of even \([2,b\)-factors in graphs]

Cites Work

• Unnamed Item
• On Spanning and Dominating Circuits in Graphs