Powers of connected graphs and hamiltonicity
From MaRDI portal
Publication:798671
Recommendations
Cites work
- scientific article; zbMATH DE number 3570493 (Why is no real title available?)
- In the square of graphs, Hamiltonicity and pancyclicity, Hamiltonian connectedness and panconnectedness are equivalent concepts
- MinimumK-hamiltonian graphs
- Minimumk-hamiltonian graphs, II
- The cube of every connected graph is 1-hamiltonian
- The powers of a connected graph are highly hamiltonian
Cited in
(17)- Hamiltonian-colored powers of strong digraphs
- Problem 83
- Hamiltonian properties of the cube of a 2-edge connected graph
- Hamiltonicity of the inner power of a cycle.
- scientific article; zbMATH DE number 3863239 (Why is no real title available?)
- Two edge-disjoint Hamiltonian cycles of powers of a graph
- scientific article; zbMATH DE number 123733 (Why is no real title available?)
- Minimumk-hamiltonian graphs, II
- Graph Powers, Delsarte, Hoffman, Ramsey, and Shannon
- scientific article; zbMATH DE number 147635 (Why is no real title available?)
- scientific article; zbMATH DE number 3999969 (Why is no real title available?)
- Duchet-type theorems for powers of HHD-free graphs
- Graph powers and \(k\)-ordered hamiltonicity
- The spectral radius and \(k\)-power of Hamilton cycle of graphs
- MinimumK-hamiltonian graphs
- Remarks on Hamiltonian properties of powers of digraphs
- The 2-hamiltonian cubes of graphs
This page was built for publication: Powers of connected graphs and hamiltonicity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q798671)