The Smallest Cubic Graphs of Girth Nine
From MaRDI portal
Recommendations
Cites work
Cited in
(25)- On the number of components of \((k,g)\)-cages after vertex deletion
- A note on the problem of finding a (3,9)-cage
- Constructions for cubic graphs with large girth
- On cages for girth pair \((6,b)\)
- A simple method for constructing small cubic graphs of girths 14, 15, and 16
- Every cubic cage is quasi 4-connected
- Cayley type graphs and cubic graphs of large girth
- Small regular graphs of girth 7
- Constructions of small regular bipartite graphs of girth 6
- Every Cubic Cage is quasi 4-connected
- scientific article; zbMATH DE number 3952807 (Why is no real title available?)
- scientific article; zbMATH DE number 1156668 (Why is no real title available?)
- Families of small regular graphs of girth 5
- On graphs with excess or defect 2
- Generation of cubic graphs and snarks with large girth
- All (k;g)‐cages are edge‐superconnected
- Computational determination of (3,11) and (4,7) cages
- Triples and hexagons
- Cops and attacking robbers with cycle constraints
- On the existence of (r, g, )-cages
- New small regular graphs of given girth: the cage problem and beyond
- Smallest cubic graphs with prescribed properties
- On the connectivity of \((k,g)\)-cages of even girth
- Finding small regular graphs of girths 6, 8 and 12 as subgraphs of cages
- On upper bounds of odd girth cages
This page was built for publication: The Smallest Cubic Graphs of Girth Nine
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4868733)