scientific article
From MaRDI portal
Publication:3866156
zbMath0429.05052MaRDI QIDQ3866156
Publication date: 1978
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
planar graphsHamiltonian cyclesdirected graphsHamiltonian pathspancyclic graphsconditionsvalencyhypohamiltonian graphsstrongly Hamiltonian graphspanconnected graphs
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)
Related Items (22)
Cyclically 5-edge-connected cubic planar graphs and shortness coefficients ⋮ Toughness and Hamiltonicity of a class of planar graphs ⋮ The diameter of the cube-connected cycles ⋮ Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey ⋮ Hamiltonian cycles in the cartesian product of a tree and a cycle ⋮ Circuits through specified edges ⋮ Not every 2-tough graph is Hamiltonian ⋮ Hamilton cycles in dense vertex-transitive graphs ⋮ The Hamiltonian properties of supergrid graphs ⋮ Resolving the Hamiltonian problem for vertex-transitive graphs of order a product of two primes ⋮ The ubiquitous Petersen graph ⋮ Toughness in graphs -- a survey ⋮ On the edge connectivity, Hamiltonicity, and toughness of vertex-transitive graphs ⋮ The generalized hierarchical product of graphs ⋮ On the hamiltonicity of the Cartesian product ⋮ Hamilton cycles and paths in vertex-transitive graphs-current directions ⋮ On subdivision graphs which are 2-steps Hamiltonian graphs and hereditary non 2-steps Hamiltonian graphs ⋮ Inductive definition of two restricted classes of triangulations ⋮ On hamiltonian line graphs and connectivity ⋮ Toughness and Delaunay triangulations ⋮ A closure concept based on neighborhood unions of independent triples ⋮ Vertex-transitive graphs that have no Hamilton decomposition
This page was built for publication:
