Hamilton-connected, vertex-pancyclic and bipartite holes
From MaRDI portal
Publication:2675870
DOI10.1016/j.disc.2022.113158zbMath1497.05137OpenAlexW4295983928MaRDI QIDQ2675870
Publication date: 26 September 2022
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2022.113158
Paths and cycles (05C38) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45) Vertex degrees (05C07)
Cites Work
- Unnamed Item
- Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey
- New sufficient conditions for cycles in graphs
- The \(k\)-dominating cycles in graphs
- Pancyclicity of Hamiltonian and highly connected graphs
- Advances on the Hamiltonian problem -- a survey
- Chvátal-Erdős conditions for paths and cycles in graphs and digraphs. A survey
- Pancyclic graphs. I
- Updating the hamiltonian problem—A survey
- Hamilton Cycles, Minimum Degree, and Bipartite Holes
- Some Theorems on Abstract Graphs
This page was built for publication: Hamilton-connected, vertex-pancyclic and bipartite holes