Shortness coefficient of cyclically 4-edge-connected cubic graphs

DOI10.37236/8440zbMath1432.05059OpenAlexW3004491077MaRDI QIDQ2294112

Jens M. Schmidt, Carol T. Zamfirescu, On-Hei S. Lo, Nicolas Van Cleemput

Publication date: 10 February 2020

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://www.combinatorics.org/ojs/index.php/eljc/article/view/v27i1p43

Mathematics Subject Classification ID

Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Related Items (1)

$K_2$-Hamiltonian Graphs: I

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On snarks that are far from being 3-edge colorable
• Hamiltonian properties of polyhedra with few 3-cuts. A survey
• Non-Hamiltonian cubic planar maps
• Shortness coefficient of cyclically 5-connected cubic planar graphs
• Non-Hamiltonian simple 3-polytopes having just two types of faces
• Pairs of edge-disjoint Hamiltonian circuits
• Polyhedral graphs without Hamiltonian cycles
• Circumference of 3-connected cubic graphs
• Polyhedra with few 3-cuts are Hamiltonian
• Long cycles in 3-connected graphs
• Shortness exponents of families of graphs
• Simple paths on polyhedra
• Cubic Graphs with Large Circumference Deficit
• A Theorem on Planar Graphs
• Regular planar graphs with faces of only two types and shortness parameters
• Some new results about the shortness exponent in polyhedral graphs
• Longest Cycles in 3-Connected 3-Regular Graphs
• Reflections on graph theory
• Nonhamiltonian 3-Connected Cubic Planar Graphs
• Flip-Flops in Hypohamiltonian Graphs
• A theorem on paths in planar graphs

This page was built for publication: Shortness coefficient of cyclically 4-edge-connected cubic graphs