On \(k\)-path pancyclic graphs
From MaRDI portal
Publication:2344015
DOI10.7151/dmgt.1795zbMath1311.05100OpenAlexW2091323281MaRDI QIDQ2344015
Publication date: 11 May 2015
Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.1795
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Hamilton connected graphs
- Panconnected graphs. II
- The square of a block is Hamiltonian connected
- Vertex pancyclic graphs
- Geodesic-pancyclic graphs
- The square of every two-connected graph is Hamiltonian
- Note on Hamilton Circuits
- Path connected graphs
- The cube of every connected graph is 1-hamiltonian
- Some Theorems on Abstract Graphs
This page was built for publication: On \(k\)-path pancyclic graphs