The following pages link to (Q5575344):
Displaying 18 items.
- Multiple Hamilton cycles in bipartite cubic graphs: an algebraic method (Q730367) (← links)
- On some conjectures on cubic 3-connected graphs (Q914697) (← links)
- Every simple 3-polytype with 34 vertices is Hamiltonian (Q1081618) (← links)
- The smallest non-Hamiltonian 3-connected cubic planar graphs have 38 vertices (Q1085184) (← links)
- On regular graphs and Hamiltonian circuits, including answers to some questions of Joseph Zaks (Q1141659) (← links)
- Non-Hamiltonian simple 3-polytopes whose faces are all 5-gons or 7-gons (Q1158440) (← links)
- Shortness parameters of families of regular planar graphs in two or three types of faces (Q1167746) (← links)
- Pairs of Hamiltonian circuits in 5-connected planar graphs (Q1218869) (← links)
- Spanning cycles of nearly cubic graphs (Q1250225) (← links)
- On shortness coefficients of simple 3-polytopal graphs with only one type of faces besides triangles (Q1322206) (← links)
- Vertices of small degree in uniquely Hamiltonian graphs (Q1569030) (← links)
- Cuts in matchings of 3-connected cubic graphs (Q1633599) (← links)
- The maximum number of Hamiltonian cycles in graphs with a fixed number of vertices and edges (Q1977262) (← links)
- On the minimum leaf number of cubic graphs (Q2324488) (← links)
- Toughness and nonhamiltonicity of polyhedral graphs (Q2366022) (← links)
- Hamiltonian circuits on simple 3-polytopes (Q2556413) (← links)
- Shortness exponents of families of graphs (Q2561232) (← links)
- Barnette's conjecture through the lens of the \(Mod_k P\) complexity classes (Q2695474) (← links)
