A new sufficient condition for pancyclability of graphs
From MaRDI portal
Publication:741733
DOI10.1016/j.dam.2013.08.026zbMath1300.05146OpenAlexW2010125980MaRDI QIDQ741733
Publication date: 12 September 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2013.08.026
Related Items
Partial degree conditions and cycle coverings in bipartite graphs, Analyzing lattice networks through substructures, Vertex-based and edge-based centroids of graphs
Cites Work
- A sufficient condition for pancyclability of graphs
- A cycle structure theorem for Hamiltonian graphs
- The Geng-Hua Fan conditions for pancyclic or Hamilton-connected graphs
- An Ore-type condition for pancyclability
- Locally pancyclic graphs
- Cycles through prescribed vertices with large degree sum
- Sequences, claws and cyclability of graphs
- Cycles and Connectivity in Graphs
- Unnamed Item
- Unnamed Item