Cubic Graphs with Large Circumference Deficit

DOI10.1002/jgt.21911zbMath1342.05034arXiv1310.1042OpenAlexW2963746401MaRDI QIDQ3188672

Ján Mazák, Edita Máčajová

Publication date: 12 August 2016

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1310.1042

zbMATH Keywords

cubic graphgirthcircumferencesnark

Mathematics Subject Classification ID

Paths and cycles (05C38) Distance in graphs (05C12) Connectivity (05C40)

Related Items (4)

Cuts in matchings of 3-connected cubic graphs ⋮ Shortness coefficient of cyclically 4-edge-connected cubic graphs ⋮ The smallest nontrivial snarks of oddness 4 ⋮ Circumference of essentially 4-connected planar triangulations

Cites Work

• Unnamed Item
• Unnamed Item
• On stable cycles and cycle double covers of graphs with large circumference
• Generation and properties of snarks
• Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs
• Longest cycles in 3-connected cubic graphs
• Classification and characterizations of snarks
• Measurements of edge-uncolorability
• Snarks without small cycles
• Reducible configurations for the cycle double cover conjecture
• Longest Cycles in 3-Connected 3-Regular Graphs
• Longest Cycles in 2-Connected Graphs with Prescribed Maximum Degree
• Circumference of Graphs with Bounded Degree

This page was built for publication: Cubic Graphs with Large Circumference Deficit