Geodesic-pancyclic graphs
A graph \(G\) is said to be geodesic-pancyclic if every path of length \(d\) between any two vertices \(u\) and \(v\) at distance \(d\) (i.e., the shortest path between \(u\) and \(v\)) can be completed to a cycle of length \(\ell\) for every \(\ell=\max\{2d,3\},\dots,n\). The authors show that several conditions known to guarantee that a graph \(G\) is panconnected, i.e., any two vertices at distance \(d\) are joined by paths of lengths \(\ell=d,\dots,n-1\), also guarantee that \(G\) is geodesic-pancyclic. E.g., they show that every graph with minimum degree \((n+2)/2\) is geodesic-pancyclic.
- A characterization of panconnected graphs satisfying a local ore-type condition
- Advances on the Hamiltonian problem -- a survey
- Arc coverings of graphs
- scientific article; zbMATH DE number 3550742 (Why is no real title available?)
- Note on Hamilton Circuits
- Panconnected graphs. II
- Path connected graphs
- Some Theorems on Abstract Graphs
- Vertex pancyclic graphs
- Geodesic-pancyclicity and fault-tolerant panconnectivity of augmented cubes
- On \(k\)-path pancyclic graphs
- scientific article; zbMATH DE number 7034414 (Why is no real title available?)
- \((n-3)\)-edge-fault-tolerant weak-pancyclicity of \((n,k)\)-star graphs
- Geodesic pancyclicity and balanced pancyclicity of the generalized base-\(b\) hypercube
- Geodesic pancyclicity of twisted cubes
- Geodesic bipancyclicity of the Cartesian product of graphs
- scientific article; zbMATH DE number 3893234 (Why is no real title available?)
- Degree conditions for weakly geodesic pancyclic graphs and their exceptions
- Geodesic pancyclicity and balanced pancyclicity of augmented cubes
This page was built for publication: Geodesic-pancyclic graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2381818)
