Cages—a survey

DOI10.1002/jgt.3190060103zbMath0488.05044OpenAlexW2137347071MaRDI QIDQ3949078

Publication date: 1982

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190060103

zbMATH Keywords

survey bibliography regular graphs girth cages Moore-graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Paths and cycles (05C38)

Related Items

The matching polynomial of a regular graph, Counting subgraphs: A new approach to the Caccetta-Häggkvist conjecture, New small regular graphs of girth 5, Highly irregular m-chromatic graphs, Graphs such that every two edges are contained in a shortest cycle, On the connectivity of cages with girth five, six and eight, On bi-regular cages of even girth at least 8, Generalized polygons and star graphs of cyclic presentations of groups, On the order of graphs with a given girth pair, On biregular bipartite graphs of small excess, On superconnectivity of (\(4, g\))-cages, Injective edge-coloring of subcubic graphs, On cages admitting identifying codes, Partial linear spaces and identifying codes, On the order of \((\{r,m\};g)\)-cages of even girth, The minimum semidefinite rank of a triangle-free graph, The Smallest Cubic Graphs of Girth Nine, Families of small regular graphs of girth 5, The 10-cages and derived configurations, Monotonicity of the order of \((D;g)\)-cages, Graphs and degree sequences. I, On the connectivity of \((k,g)\)-cages of even girth, Maximally edge-connected and vertex-connected graphs and digraphs: A survey, New graphs related to \((p,6)\) and \((p,8)\)-cages, Extremal non-bipartite regular graphs of girth 4, Diameter and connectivity of (D; g)-cages, On cages with given degree sets, Hamiltonian property of the incidence graphs of quadrangles associated with symplectic forms on finite fields, Upper bound on distance in the pants complex, Finding small regular graphs of girths 6, 8 and 12 as subgraphs of cages, On upper bounds of odd girth cages, Lower bound of cyclic edge connectivity for \(n\)-extendability of regular graphs, Adjacency matrices of polarity graphs and of other \(C_{4}\)-free graphs of large size, New improvements on connectivity of cages, Unnamed Item, Fast generation of regular graphs and construction of cages, Codes for distributed storage from 3-regular graphs, A new bound for the connectivity of cages, The face pair of planar graphs, On superconnectivity of (4,g)-cages with even girth, An alternate description of a (q + 1, 8)-cage, Counting independent sets in cubic graphs of given girth, On the girth of extremal graphs without shortest cycles, Tripartite graphs with given degree set, Small regular graphs of girth 7, Constructions of small regular bipartite graphs of girth 6, Every cubic cage is quasi 4-connected, Perfect broadcasting in unlabeled networks, Constructions of bi-regular cages, Improving bounds on the order of regular graphs of girth 5, Girth of sparse graphs, Small vertex-transitive and Cayley graphs of girth six and given degree: an algebraic approach, On the smallest graph of girth 10 and valency 3, Calculation of general recoupling coefficients using graphical methods, Regular \(K_n\)-free graphs, Improved lower bound for the vertex connectivity of \((\delta ;g)\)-cages, \((k,g)\)-cages are 3-connected, (\(\delta ,g\))-cages with \(g\geqslant 10\) are 4-connected, Comparison of mean distance in superposed networks, A continuous analogue of the girth problem, Regularizing irregular graphs, Every Cubic Cage is quasi 4-connected, On upper bounds and connectivity of cages, On the order of bi-regular cages of even girth, On the monotonicity of \((k;g,h)\)-graphs, On a conjecture on the order of cages with a given girth pair, On chromatic uniqueness of uniform subdivisions of graphs

Cites Work