The Smallest Cubic Graphs of Girth Nine

DOI10.1017/S0963548300001693zbMath0841.05055MaRDI QIDQ4868733

Carsten Saager, Brendan D. McKay, Gunnar Brinkmann

Publication date: 14 July 1996

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

zbMATH Keywords

girthcubic graphs

Mathematics Subject Classification ID

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

Related Items (12)

Families of small regular graphs of girth 5 ⋮ On graphs with excess or defect 2 ⋮ 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 ⋮ Computational determination of (3,11) and (4,7) cages ⋮ Small regular graphs of girth 7 ⋮ Constructions of small regular bipartite graphs of girth 6 ⋮ All (k;g)‐cages are edge‐superconnected ⋮ Every cubic cage is quasi 4-connected ⋮ On the number of components of \((k,g)\)-cages after vertex deletion ⋮ Every Cubic Cage is quasi 4-connected

Uses Software

• nauty

Cites Work

• A trivalent graph with 58 vertices and girth 9
• A second trivalent graph with 58 vertices and girth 9
• Cages—a survey
• Every one a Winner or how to Avoid Isomorphism Search when Cataloguing Combinatorial Configurations

This page was built for publication: The Smallest Cubic Graphs of Girth Nine