Longest cycles in 3-connected cubic graphs

DOI10.1016/0095-8956(86)90024-9zbMath0591.05040OpenAlexW2023774253WikidataQ56603448 ScholiaQ56603448MaRDI QIDQ1074598

Bill Jackson

Publication date: 1986

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(86)90024-9

zbMATH Keywords

cycle3-connected cubic graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38)

Related Items

Cubic Graphs with Large Circumference Deficit, On the circumference of 3-connected cubic triangle-free plane graphs, Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey, On the number of cycles in 3-connected cubic graphs, Circumference of 3-connected cubic graphs, Dual circumference and collinear sets, Balanced generic circuits without long paths, Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs, Finding large cycles in Hamiltonian graphs, Unnamed Item, Large Wk- or K3,t-Minors in 3-Connected Graphs, Unnamed Item, On Collinear Sets in Straight-Line Drawings, Edge decomposition of connected claw-free cubic graphs, Unnamed Item, Circumference of essentially 4-connected planar triangulations

Cites Work

• Shortness exponents of families of graphs
• A Theorem on Planar Graphs
• Longest Simple Paths in Polyhedral Graphs
• Longest Cycles in 3-Connected 3-Regular Graphs
• A shortness exponent forr-regularr-connected graphs
• Longest Cycles in 2-Connected Graphs with Prescribed Maximum Degree
• Trees in Polyhedral Graphs
• On Hamiltonian Circuits
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item