The following pages link to Cages—a survey (Q3949078):
Displayed 50 items.
- On bi-regular cages of even girth at least 8 (Q387618) (← links)
- On the order of graphs with a given girth pair (Q394547) (← links)
- Families of small regular graphs of girth 5 (Q449121) (← links)
- New improvements on connectivity of cages (Q546369) (← links)
- Partial linear spaces and identifying codes (Q627920) (← links)
- The minimum semidefinite rank of a triangle-free graph (Q630548) (← links)
- Monotonicity of the order of \((D;g)\)-cages (Q654223) (← links)
- New graphs related to \((p,6)\) and \((p,8)\)-cages (Q660907) (← links)
- A new bound for the connectivity of cages (Q712582) (← links)
- Comparison of mean distance in superposed networks (Q793635) (← links)
- On the connectivity of cages with girth five, six and eight (Q878639) (← links)
- On the connectivity of \((k,g)\)-cages of even girth (Q932601) (← links)
- Maximally edge-connected and vertex-connected graphs and digraphs: A survey (Q932603) (← links)
- Finding small regular graphs of girths 6, 8 and 12 as subgraphs of cages (Q965992) (← links)
- On upper bounds of odd girth cages (Q968440) (← links)
- Adjacency matrices of polarity graphs and of other \(C_{4}\)-free graphs of large size (Q970541) (← links)
- On the girth of extremal graphs without shortest cycles (Q998448) (← links)
- Constructions of bi-regular cages (Q1024448) (← links)
- Highly irregular m-chromatic graphs (Q1117253) (← links)
- Graphs such that every two edges are contained in a shortest cycle (Q1122590) (← links)
- On cages with given degree sets (Q1197020) (← links)
- Lower bound of cyclic edge connectivity for \(n\)-extendability of regular graphs (Q1210558) (← links)
- Perfect broadcasting in unlabeled networks (Q1270770) (← links)
- Calculation of general recoupling coefficients using graphical methods (Q1292610) (← links)
- \((k,g)\)-cages are 3-connected (Q1297446) (← links)
- Regularizing irregular graphs (Q1310226) (← links)
- On chromatic uniqueness of uniform subdivisions of graphs (Q1322194) (← links)
- The matching polynomial of a regular graph (Q1343771) (← links)
- Counting subgraphs: A new approach to the Caccetta-Häggkvist conjecture (Q1356730) (← links)
- The 10-cages and derived configurations (Q1420606) (← links)
- Hamiltonian property of the incidence graphs of quadrangles associated with symplectic forms on finite fields (Q1756079) (← links)
- Counting independent sets in cubic graphs of given girth (Q1791708) (← links)
- Every cubic cage is quasi 4-connected (Q1810654) (← links)
- On the smallest graph of girth 10 and valency 3 (Q1837206) (← links)
- Regular \(K_n\)-free graphs (Q1838977) (← links)
- A continuous analogue of the girth problem (Q1850595) (← links)
- On the monotonicity of \((k;g,h)\)-graphs (Q1862823) (← links)
- On superconnectivity of (\(4, g\))-cages (Q1938884) (← links)
- Codes for distributed storage from 3-regular graphs (Q2012057) (← links)
- Upper bound on distance in the pants complex (Q2255552) (← links)
- Improving bounds on the order of regular graphs of girth 5 (Q2317664) (← links)
- On a conjecture on the order of cages with a given girth pair (Q2352778) (← links)
- New small regular graphs of girth 5 (Q2397530) (← links)
- On biregular bipartite graphs of small excess (Q2421873) (← links)
- On cages admitting identifying codes (Q2426452) (← links)
- On the order of \((\{r,m\};g)\)-cages of even girth (Q2427507) (← links)
- The face pair of planar graphs (Q2502900) (← links)
- Tripartite graphs with given degree set (Q2516853) (← links)
- Small regular graphs of girth 7 (Q2517652) (← links)
- Improved lower bound for the vertex connectivity of \((\delta ;g)\)-cages (Q2568484) (← links)