Pancyclism in Chvátal-Erdős' graphs
From MaRDI portal
Publication:809093
DOI10.1007/BF01788136zbMATH Open0732.05034OpenAlexW2030170217MaRDI QIDQ809093FDOQ809093
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
Cites Work
Cited In (15)
- Pancyclic BIBD block-intersection graphs
- Hamiltonicity, independence number, and pancyclicity
- Results and problems on chorded cycles: a survey
- Pancyclicity of Hamiltonian and highly connected graphs
- Bipanconnectivity of faulty hypercubes with minimum degree
- The Chvátal-Erdös condition for cycles in triangle-free graphs
- Chvátal-Erdős condition for pancyclicity
- A note on pancyclism of highly connected graphs
- A new Chvátal type condition for pancyclicity
- A Chvátal--Erdős type condition for pancyclability
- The proper 2-connection number of several graph classes
- Chvátal–Erdős Theorem: Old Theorem with New Aspects
- Cycles in triangle-free graphs
- A 2‐factor with two components of a graph satisfying the Chvátal‐Erdös condition
- The Chvátal-Erdős condition and pancyclic line-graphs
This page was built for publication: Pancyclism in Chvátal-Erdős' graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q809093)