The sextet construction for cubic graphs
From MaRDI portal
Publication:1055779
DOI10.1007/BF02579289zbMath0522.05030OpenAlexW2011219060MaRDI QIDQ1055779
Publication date: 1983
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02579289
Related Items (23)
Minors in graphs of large girth ⋮ Explicit construction of graphs with an arbitrary large girth and of large size ⋮ Containment: a variation of cops and robber ⋮ Symmetries in graphs via simplicial automorphisms ⋮ A randomized construction of high girth regular graphs ⋮ A new series of dense graphs of high girth ⋮ On the girth of voltage graph lifts ⋮ Note on the girth of Ramanujan graphs ⋮ The finite vertex-primitive and vertex-biprimitive $s$-transitive graphs for $s\ge 4$ ⋮ Exponential domination in subcubic graphs ⋮ Triples and hexagons ⋮ Keyed hash function from large girth expander graphs ⋮ Presentations for (G, s)-transitive graphs of small valency ⋮ On the girth of random Cayley graphs ⋮ A classification of nilpotent $3$-BCI groups ⋮ A refined classification of symmetric cubic graphs ⋮ On the homogeneous algebraic graphs of large girth and their applications ⋮ The infinitude of 7-arc-transitive graphs ⋮ Shifts in Cayley graphs ⋮ Sporadic simple groups which are completions of the Goldschmidt \(G_3\)-amalgam ⋮ Kissing numbers of regular graphs ⋮ A hierarchy of randomness for graphs ⋮ Girths of bipartite sextet graphs
Cites Work
This page was built for publication: The sextet construction for cubic graphs