Chvátal---Erdős Theorem: Old Theorem with New Aspects

Authors:
Akira Saito
Affiliations:
Department of Computer Science, Nihon University, Tokyo, Japan 156-8550
Venue:
Computational Geometry and Graph Theory
Year:
2008

Citing 10
Cited 0

Graphs & digraphs (2nd ed.)

Graphs & digraphs (2nd ed.)
A note on distance-dominating cycles

Discrete Mathematics
Chva´tal–Erdo´s conditions for paths and cycles in graphs and digraphs. A survey

Discrete Mathematics
Updating the Hamiltonian problem—a survey

Journal of Graph Theory
Cycles in graphs with prescribed stability number and connectivity

Journal of Combinatorial Theory Series B
The Chvátal-Erdős condition for cycles in triangle-free graphs

Discrete Mathematics
Degree conditions for 2-factors

Journal of Graph Theory
Long cycles in triangle-free graphs with prescribed independence number and connectivity

Journal of Combinatorial Theory Series B
On a k-Tree Containing Specified Leaves in a Graph

Graphs and Combinatorics
A 2-factor with two components of a graph satisfying the Chvátal-Erdös condition

Journal of Graph Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Chvátal---Erdős Theorem states that a 2-connected graph is hamiltonian if its independence number is bounded from above by its connectivity. In this short survey, we explore the recent development on the extensions and the variants of this theorem.