The Chvátal-Erdős condition for a graph to have a spanning trail

DOI10.1007/S00373-014-1484-3zbMath1321.05193OpenAlexW2075085574MaRDI QIDQ497374

Runli Tian, Limning Xiong

Publication date: 24 September 2015

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-014-1484-3

zbMATH Keywords

independence numberconnectivityline graphChvátal-Erdős conditionspanning trail

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)

Related Items (5)

Spanning trails with variations of Chvátal-Erdős conditions ⋮ Constructing featured supereulerian graph ⋮ Supereulerian graphs with constraints on the matching number and minimum degree ⋮ Chvátal-Erdős conditions and almost spanning trails ⋮ A condition on Hamilton-connected line graphs

Cites Work

• Unnamed Item
• The Chvàtal-Erdős condition for supereulerian graphs and the Hamiltonian index
• Traceability of line graphs
• The Chvátal-Erdős condition and pancyclic line-graphs
• Cycles in graphs with prescribed stability number and connectivity
• A note on Hamiltonian circuits
• On Eulerian and Hamiltonian Graphs and Line Graphs

This page was built for publication: The Chvátal-Erdős condition for a graph to have a spanning trail