Cubic Graphs with Large Circumference Deficit
From MaRDI portal
Publication:3188672
DOI10.1002/jgt.21911zbMath1342.05034arXiv1310.1042OpenAlexW2963746401MaRDI QIDQ3188672
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
Related Items
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
- 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
- Unnamed Item
- Unnamed Item