A new sufficient condition for pancyclability of graphs
From MaRDI portal
Publication:741733
DOI10.1016/J.DAM.2013.08.026zbMATH Open1300.05146OpenAlexW2010125980MaRDI QIDQ741733FDOQ741733
Authors: Hao Li, Junqing Cai 
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
Recommendations
Cites Work
- Graph theory
- The Geng-Hua Fan conditions for pancyclic or Hamilton-connected graphs
- A cycle structure theorem for Hamiltonian graphs
- An Ore-type condition for pancyclability
- Locally pancyclic graphs
- Cycles through prescribed vertices with large degree sum
- Sequences, claws and cyclability of graphs
- Title not available (Why is that?)
- Cycles and Connectivity in Graphs
- A sufficient condition for pancyclability of graphs
Cited In (13)
- Partial degree conditions and cycle coverings in bipartite graphs
- A note on a new condition implying pancyclism
- New sufficient conditions for cycles in graphs
- A sufficient condition for pancyclic graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Cyclability and pancyclability in bipartite graphs
- Analyzing lattice networks through substructures
- Vertex-based and edge-based centroids of graphs
- A new Chvátal type condition for pancyclicity
- A sufficient condition for pancyclability of graphs
- A sufficient condition of a pancyclicity \([s,t]\)-graph
- Title not available (Why is that?)
This page was built for publication: A new sufficient condition for pancyclability of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q741733)
