The cube of every connected graph is 1-hamiltonian
From MaRDI portal
Publication:5562547
DOI10.6028/jres.073B.007zbMath0174.26802OpenAlexW2330053191MaRDI QIDQ5562547
Publication date: 1969
Published in: Journal of Research of the National Bureau of Standards, Section B: Mathematical Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.6028/jres.073b.007
Related Items (15)
An upper bound on the number of edges of a graph whose \(k\)th power has a connected complement ⋮ Eine Eigenschaft der dritten Potenz brückenloser Graphen ⋮ Single-source three-disjoint path covers in cubes of connected graphs ⋮ Disjoint path covers in cubes of connected graphs ⋮ Hamiltonian properties of the cube of a 2-edge connected graph ⋮ Spanning connectivity of the power of a graph and Hamilton-connected index of a graph ⋮ Some recent results in hamiltonian graphs ⋮ Stacked polytopes and tight triangulations of manifolds ⋮ Minimalfunktoren nach Graphenkategorien mit HAMILTONeigenschaften ⋮ Graph theory ⋮ A linear-time algorithm for finding a paired 2-disjoint path cover in the cube of a connected graph ⋮ Graphs with 1-hamiltonian-connected cubes ⋮ Powers of connected graphs and hamiltonicity ⋮ On \(k\)-path pancyclic graphs ⋮ A distributed enumeration algorithm and applications to all pairs shortest paths, diameter\dots
This page was built for publication: The cube of every connected graph is 1-hamiltonian
