Pancyclism in Chvátal-Erdős' graphs
From MaRDI portal
Publication:809093
DOI10.1007/BF01788136zbMath0732.05034OpenAlexW2030170217MaRDI QIDQ809093
Irene Fournier, Anne Germa, Denise Amar
Publication date: 1991
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01788136
Related Items (10)
Pancyclic BIBD block-intersection graphs ⋮ CYCLES IN TRIANGLE-FREE GRAPHS ⋮ A note on pancyclism of highly connected graphs ⋮ Chvátal–Erdős Theorem: Old Theorem with New Aspects ⋮ The Chvátal-Erdös condition for cycles in triangle-free graphs ⋮ Hamiltonicity, independence number, and pancyclicity ⋮ Bipanconnectivity of faulty hypercubes with minimum degree ⋮ Pancyclicity of Hamiltonian and highly connected graphs ⋮ A 2‐factor with two components of a graph satisfying the Chvátal‐Erdös condition ⋮ Results and problems on chorded cycles: a survey
Cites Work
This page was built for publication: Pancyclism in Chvátal-Erdős' graphs
