scientific article; zbMATH DE number 3292649
From MaRDI portal
Publication:5575344
zbMath0183.52302MaRDI QIDQ5575344
Publication date: 1967
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (18)
Every simple 3-polytype with 34 vertices is Hamiltonian ⋮ Toughness and nonhamiltonicity of polyhedral graphs ⋮ The smallest non-Hamiltonian 3-connected cubic planar graphs have 38 vertices ⋮ Cuts in matchings of 3-connected cubic graphs ⋮ On regular graphs and Hamiltonian circuits, including answers to some questions of Joseph Zaks ⋮ Barnette's conjecture through the lens of the \(Mod_k P\) complexity classes ⋮ Non-Hamiltonian simple 3-polytopes whose faces are all 5-gons or 7-gons ⋮ On some conjectures on cubic 3-connected graphs ⋮ Shortness parameters of families of regular planar graphs in two or three types of faces ⋮ The maximum number of Hamiltonian cycles in graphs with a fixed number of vertices and edges ⋮ Pairs of Hamiltonian circuits in 5-connected planar graphs ⋮ Multiple Hamilton cycles in bipartite cubic graphs: an algebraic method ⋮ Spanning cycles of nearly cubic graphs ⋮ Vertices of small degree in uniquely Hamiltonian graphs ⋮ Hamiltonian circuits on simple 3-polytopes ⋮ On the minimum leaf number of cubic graphs ⋮ Shortness exponents of families of graphs ⋮ On shortness coefficients of simple 3-polytopal graphs with only one type of faces besides triangles
This page was built for publication:
