The following pages link to Dynamic cage survey (Q2378882):
Displaying 50 items.
- Cayley cages (Q356724) (← links)
- On bi-regular cages of even girth at least 8 (Q387618) (← links)
- On the order of graphs with a given girth pair (Q394547) (← links)
- Recursive constructions of small regular graphs of given degree and girth (Q442380) (← links)
- Families of small regular graphs of girth 5 (Q449121) (← links)
- New family of small regular graphs of girth 5 (Q510562) (← links)
- The complexity of partitioning into disjoint cliques and a triangle-free graph (Q516874) (← links)
- On bipartite cages of excess 4 (Q521356) (← links)
- Computational determination of (3,11) and (4,7) cages (Q553952) (← links)
- Partial linear spaces and identifying codes (Q627920) (← links)
- Monotonicity of the order of \((D;g)\)-cages (Q654223) (← links)
- New graphs related to \((p,6)\) and \((p,8)\)-cages (Q660907) (← links)
- On the limitations of the use of solvable groups in Cayley graph cage constructions (Q709252) (← links)
- A new bound for the connectivity of cages (Q712582) (← links)
- On regular induced subgraphs of generalized polygons (Q721048) (← links)
- Improved lower bounds for the orders of even girth cages (Q727055) (← links)
- Cycles with consecutive odd lengths (Q896065) (← links)
- Small bi-regular graphs of even girth (Q898123) (← links)
- Applications of integer programming methods to cages (Q907225) (← 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)
- A note on the problem of finding a (3,9)-cage (Q1068846) (← links)
- On the defect of vertex-transitive graphs of given degree and diameter (Q1633761) (← links)
- Edge-girth-regular graphs (Q1645060) (← links)
- On the excess of vertex-transitive graphs of given degree and girth (Q1690243) (← links)
- On the non-existence of antipodal cages of even girth (Q1743143) (← links)
- Elliptic semiplanes and regular graphs with girth 5 (Q1792108) (← links)
- Rainbow connectivity of Moore cages of girth 6 (Q1801053) (← links)
- Online graph exploration: New results on old and new algorithms (Q1929219) (← links)
- On superconnectivity of (\(4, g\))-cages (Q1938884) (← links)
- Bipartite biregular Moore graphs (Q1981708) (← links)
- Largest 2-regular subgraphs in 3-regular graphs (Q2000571) (← links)
- Codes for distributed storage from 3-regular graphs (Q2012057) (← links)
- On diregular digraphs with degree two and excess three (Q2026351) (← links)
- Spectra of orders for \(k\)-regular graphs of girth \(g\) (Q2042625) (← links)
- Regular Turán numbers of complete bipartite graphs (Q2043399) (← links)
- Extremal edge-girth-regular graphs (Q2053682) (← links)
- On the distance spectrum of minimal cages and associated distance biregular graphs (Q2069865) (← links)
- Mixed cages: monotonicity, connectivity and upper bounds (Q2113343) (← links)
- Cyclic connectivity, edge-elimination, and the twisted Isaacs graphs (Q2131857) (← links)
- Edge-girth-regular graphs arising from biaffine planes and Suzuki groups (Q2144587) (← links)
- On new record graphs close to bipartite Moore graphs (Q2152609) (← links)
- On networks with order close to the Moore bound (Q2165254) (← links)
- The cubic graphs with finite cyclic vertex connectivity larger than girth (Q2214044) (← links)
- On the packing chromatic number of Moore graphs (Q2217471) (← links)
- A connection between a question of Bermond and Bollobás and Ramanujan graphs (Q2230812) (← links)
- A new upper bound for the traveling salesman problem in cubic graphs (Q2250536) (← links)
- Maximizing algebraic connectivity for certain families of graphs (Q2261533) (← links)
- Graph-based convolutional and block LDPC codes (Q2269366) (← links)
