Constructions for cubic graphs with large girth

From MaRDI portal
Publication:1276540

zbMath0911.05036MaRDI QIDQ1276540

Norman L. Biggs

Publication date: 7 February 1999

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/119715




Related Items (36)

Symmetric cubic graphs of small girthCayley cagesDecoding turbo-like codes via linear programmingColorings of the \(d\)-regular infinite treeContainment: a variation of cops and robberExact values of \(ex(\nu ; \{C_{3},C_{4},\dots ,C_n\})\)A randomized construction of high girth regular graphsOriented cobicircular matroids are \textit{GSP}On cages admitting identifying codesNote on the bisection width of cubic graphsUsing bi-coset graphs to construct small regular and biregular graphsApplications of integer programming methods to cagesRecursive constructions of small regular graphs of given degree and girthSmall graphs and hypergraphs of given degree and girthFamilies of small regular graphs of girth 5Graphs of systoles on hyperbolic surfacesFractional total colourings of graphs of high girthA Local-Search Algorithm for Steiner ForestNew graphs related to \((p,6)\) and \((p,8)\)-cagesTopological minors in line graphs -- a proof of Zha's conjectureKeyed hash function from large girth expander graphsOn cycle lengths in claw-free graphs with complete closureCompletions of Goldschmidt amalgams of type \(G_4\) in dimension 3Finding small regular graphs of girths 6, 8 and 12 as subgraphs of cagesOn upper bounds of odd girth cagesMaximizing algebraic connectivity for certain families of graphsNew families of graphs without short cycles and large sizeOn the limitations of the use of solvable groups in Cayley graph cage constructionsGraph-based convolutional and block LDPC codesSmall regular graphs of girth 7Constructions of small regular bipartite graphs of girth 6Small vertex-transitive and Cayley graphs of girth six and given degree: an algebraic approachLogarithmic girth expander graphs of \(SL_n({\mathbb{F}}_p)\)Systolic geometry of connected sums and cyclic covering.Kissing numbers of regular graphsFractional Chromatic Number, Maximum Degree, and Girth




This page was built for publication: Constructions for cubic graphs with large girth