Panconnected graphs. II
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3455294 (Why is no real title available?)
- scientific article; zbMATH DE number 3550742 (Why is no real title available?)
- scientific article; zbMATH DE number 3293646 (Why is no real title available?)
- scientific article; zbMATH DE number 3377257 (Why is no real title available?)
- A generalization of hamiltonian-connected graphs
- A note on Hamiltonian circuits
- A sufficient condition for hamiltonian connectedness
- Arc coverings of graphs
- Hamilton connected graphs
- Nonhamiltonian connected graphs
- Note on Hamilton Circuits
- On Hamilton's ideals
- On a Problem of Ore
- Some Theorems on Abstract Graphs
- Theory of path length distributions. I
- Variations on the Hamiltonian Theme
Cited in
(24)- Vertex pancyclic graphs
- Minimum degree condition for proper connection number 2
- Degree sum and graph linkage with prescribed path lengths
- Placing specified vertices at precise locations on a Hamiltonian cycle
- On \(k\)-path pancyclic graphs
- Highly irregular
- Locating pairs of vertices on a Hamiltonian cycle in bigraphs
- Graph theory (algorithmic, algebraic, and metric problems)
- Precise location of vertices on Hamiltonian cycles
- Locating pairs of vertices on Hamiltonian cycles
- The Ramsey number of a long even cycle versus a star
- Geodesic-pancyclic graphs
- Note on locating pairs of vertices on Hamiltonian cycles
- Enomoto and Ota's conjecture holds for large graphs
- On cycles that alternate through selected sets of vertices
- Minimum degree and pan-\(k\)-linked graphs
- Vertex pancyclic graphs
- Proper connection of graphs
- Distributing pairs of vertices on Hamiltonian cycles
- An anti-Ramsey theorem on cycles
- A panconnectivity theorem for bipartite graphs
- Subdivisions of graphs: A generalization of paths and cycles
- Minimum Degrees for Powers of Paths and Cycles
- Distributing vertices on Hamiltonian cycles
This page was built for publication: Panconnected graphs. II
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1230793)