The Chvàtal-Erdős condition for supereulerian graphs and the Hamiltonian index

DOI10.1016/j.disc.2010.03.020zbMath1258.05061OpenAlexW2032096410MaRDI QIDQ982614

Longsheng Han, Hong-Jian Lai, Huiya Yan, Limning Xiong

Publication date: 7 July 2010

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

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

zbMATH Keywords

independence numberconnectivityPetersen graphsupereulerian graphHamiltonian index

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (16)

Spanning trails with variations of Chvátal-Erdős conditions ⋮ Hamiltonian index of directed multigraph ⋮ Constructing featured supereulerian graph ⋮ Supereulerian graphs with constraints on the matching number and minimum degree ⋮ Unnamed Item ⋮ Compatible spanning circuits and forbidden induced subgraphs ⋮ Locally dense supereulerian digraphs ⋮ Chvátal-Erdős conditions and almost spanning trails ⋮ The Chvátal-Erdős condition for a graph to have a spanning trail ⋮ Panconnected index of graphs ⋮ An extension of the Win theorem: counting the number of maximum independent sets ⋮ The Chvátal-Erdős condition for group connectivity in graphs ⋮ Supereulerian Digraphs with Large Arc-Strong Connectivity ⋮ Sufficient Conditions for a Digraph to be Supereulerian ⋮ An extension of the Chvátal-Erdős theorem: counting the number of maximum independent sets ⋮ A condition on Hamilton-connected line graphs

Cites Work

• Unnamed Item
• Unnamed Item
• The hamiltonian index of a 2-connected graph
• The Chvátal-Erdős condition and pancyclic line-graphs
• Circuits through specified edges
• Supereulerian graphs, independent sets, and degree-sum conditions
• The Chvátal-Erdős condition for panconnectivity of triangle-free graphs
• Long cycles in triangle-free graphs with prescribed independence number and connectivity
• Hamiltonian iterated line graphs
• The Hamiltonian index of a graph and its branch-bonds
• A common generalization of Chvátal-Erdös' and Fraisse's sufficient conditions for hamiltonian graphs
• Extensions and consequences of Chvátal-Erdös' theorem
• Chvátal-Erdős conditions for paths and cycles in graphs and digraphs. A survey
• A note on Hamiltonian circuits
• A reduction method to find spanning Eulerian subgraphs
• A Note on Sub-Eulerian Graphs
• On Eulerian and Hamiltonian Graphs and Line Graphs

This page was built for publication: The Chvàtal-Erdős condition for supereulerian graphs and the Hamiltonian index