Spanning 2‐trails from degree sum conditions

DOI10.1002/JGT.10162zbMATH Open1034.05031OpenAlexW4250788305MaRDI QIDQ4459608FDOQ4459608

Authors: Xiaoya Zha, Yi Zhang, M. 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

Recommendations

• Spanning trails in a 2-connected graph
• Spanning trails with maximum degree at most 4 in \(2K_2\)-free graphs
• Spanning trails with variations of Chvátal-Erdős conditions
• scientific article; zbMATH DE number 27751
• Degree sums and spanning brooms of a graph
• Degree sum conditions on two disjoint cycles in graphs
• Spanning closed trails in graphs
• A degree sum condition for graphs to be covered by two cycles
• Existence of spanning and dominating trails and circuits
• scientific article; zbMATH DE number 1926044

zbMATH Keywords

degree sumconnected even factorspanning trail

Mathematics Subject Classification ID

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

Cites Work

• Graph theory with applications
• On Spanning and Dominating Circuits in Graphs

Cited In (6)

• Ore-type conditions for the existence of even \([2,b]\)-factors in graphs
• Existence of spanning and dominating trails and circuits
• 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
• Spanning closed trails in graphs

This page was built for publication: Spanning 2‐trails from degree sum conditions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4459608)