Cages—a survey
From MaRDI portal
Publication:3949078
DOI10.1002/jgt.3190060103zbMath0488.05044MaRDI 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
05C35: Extremal problems in graph theory
05-02: Research exposition (monographs, survey articles) pertaining to combinatorics
05C38: Paths and cycles
Related Items
The Smallest Cubic Graphs of Girth Nine, On cages with given degree sets, Lower bound of cyclic edge connectivity for \(n\)-extendability of regular graphs, Perfect broadcasting in unlabeled networks, Calculation of general recoupling coefficients using graphical methods, \((k,g)\)-cages are 3-connected, Regularizing irregular graphs, On chromatic uniqueness of uniform subdivisions of graphs, The matching polynomial of a regular graph, Counting subgraphs: A new approach to the Caccetta-Häggkvist conjecture, The 10-cages and derived configurations, Every cubic cage is quasi 4-connected, A continuous analogue of the girth problem, On the monotonicity of \((k;g,h)\)-graphs, Improved lower bound for the vertex connectivity of \((\delta ;g)\)-cages, (\(\delta ,g\))-cages with \(g\geqslant 10\) are 4-connected, Unnamed Item