A Chvátal-Erdős condition for the existence of a cycle intersecting specified connected subgraphs

DOI10.1016/J.DISC.2022.112808zbMATH Open1486.05161OpenAlexW4211239150MaRDI QIDQ2124605FDOQ2124605

Authors: Shuya Chiba, Masao Tsugaki, Tomoki Yamashita 

Publication date: 11 April 2022

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

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

Recommendations

• Degree sum conditions and Chvátal-Erdös conditions for cycles
• The Chvátal-Erdös condition for cycles in triangle-free graphs
• Cycles intersecting a prescribed vertex set
• A chvátal–erdős type condition for hamiltonian graphs
• Extensions and consequences of Chvátal-Erdös' theorem

zbMATH Keywords

connectivityHamilton cycleindependence numbercyclable\( \mathcal{H} \)-intersecting cycle\( D_\lambda \)-cycle

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Paths and cycles (05C38)

Cites Work

• Graph theory
• A note on Hamiltonian circuits
• On some intriguing problems in Hamiltonian graph theory---a survey
• Recent advances on the Hamiltonian problem: survey III
• Cycles through subsets with large degree sums
• Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey
• Chvátal-Erdős conditions for paths and cycles in graphs and digraphs. A survey
• Existence of Dlambda-cycles and Dlambda-paths
• Chvátal–Erdős Theorem: Old Theorem with New Aspects

Cited In (1)

• A Chvátal--Erdős type condition for pancyclability

This page was built for publication: A Chvátal-Erdős condition for the existence of a cycle intersecting specified connected subgraphs

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