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

DOI10.1007/S00373-014-1484-3MaRDI QIDQ497374zbMATH OpenOpenAlexFDO

Authors Runli Tian, Liming 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

Chvátal-Erdős conditionconnectivityindependence numberline graphspanning trail

Mathematics Subject Classification ID

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

Recommendations

• Spanning trails with variations of Chvátal-Erdős conditions
• Chvátal-Erdős conditions and almost spanning trails
• scientific article; zbMATH DE number 6819543
• An extension of the Chvátal-Erdős theorem: counting the number of maximum independent sets
• The Chvàtal-Erdős condition for supereulerian graphs and the Hamiltonian index

Cites work

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

Cited in

(9)

• A condition on Hamilton-connected line graphs
• Chvátal-Erdős conditions and almost spanning trails
• An extension of the Chvátal-Erdős theorem: counting the number of maximum independent sets
• Spanning trails with variations of Chvátal-Erdős conditions
• Supereulerian graphs with constraints on the matching number and minimum degree
• scientific article; zbMATH DE number 4043881 (Why is no real title available?)
• Spanning trails
• Constructing featured supereulerian graph
• The Chvàtal-Erdős condition for supereulerian graphs and the Hamiltonian index

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

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