Spanning trails with variations of Chvátal-Erdős conditions

DOI10.1016/j.disc.2016.08.002zbMath1351.05169MaRDI QIDQ2374180

Yanyan Li

Publication date: 14 December 2016

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2016.08.002

zbMATH Keywords

independence number; matching number; collapsible graph; spanning trail; super-Eulerian

Mathematics Subject Classification ID

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)

Related Items

Chvátal-Erdős type conditions for Hamiltonicity of claw-free graphs, Hamiltonian line graphs with local degree conditions, On sufficient degree conditions for traceability of claw-free graphs, Chvátal-Erdős conditions and almost spanning trails

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Chvátal-Erdős condition for a graph to have a spanning trail
• Supereulerian graphs and matchings
• The Chvàtal-Erdős condition for supereulerian graphs and the Hamiltonian index
• Graphs without spanning closed trails
• Supereulerian graphs, independent sets, and degree-sum conditions
• A note on Hamiltonian circuits
• A note on graphs spanned by Eulerian graphs
• Über ein Problem von K. Zarankiewicz
• A reduction method to find spanning Eulerian subgraphs
• Supereulerian graphs: A survey
• The spanning subgraphs of eulerian graphs
• Collapsible graphs and matchings
• The Factorization of Linear Graphs
• Supereulerian graphs and the Petersen graph