Dynamic cage survey
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- New graphs related to \((p,6)\) and \((p,8)\)-cages
- New results on connectivity of cages
- New family of small regular graphs of girth 5
- On biregular bipartite graphs of small excess
- Fractional chromatic number, maximum degree, and girth
- On (k,g)-graphs without (g + 1)-cycles
- New results on bipartite biregular cages, block designs, and generalized polygons
- Banff designs: difference methods for coloring incidence graphs
- Geometric constructions of small regular graphs with girth 7
- A note on girth-diameter cages
- On extremal (almost) edge-girth-regular graphs
- The complexity of partitioning into disjoint cliques and a triangle-free graph
- On bipartite cages of excess 4
- On the girth of voltage graph lifts
- Avoidability beyond paths
- On bi-regular cages of even girth at least 8
- All McKay-Miller-Širáň graphs are bi-Cayley
- Cycles with consecutive odd lengths
- Constructions of small regular bipartite graphs of girth 6
- Symmetry properties of generalized graph truncations
- Graph-based convolutional and block LDPC codes
- Improved lower bounds for the orders of even girth cages
- On the order of graphs with a given girth pair
- Monotonicity of the order of \((D;g)\)-cages
- On diregular digraphs with degree two and excess three
- Small vertex-transitive and Cayley graphs of girth six and given degree: An algebraic approach
- scientific article; zbMATH DE number 1750094 (Why is no real title available?)
- On (r,g, ))-graphs and cages of regularity r, girth g and chromatic number
- Totally regular mixed graphs constructed from the CD(n,q) graphs of Lazebnik, Ustimenko and Woldar
- On some properties of cages
- On the harmonious chromatic number of graphs
- A construction of small \((q-1)\)-regular graphs of girth 8
- New values for the bipartite Ramsey number of the four-cycle versus stars
- Extremal regular graphs and hypergraphs related to fractional repetition codes
- On a relation between bipartite biregular cages, block designs and generalized polygons
- The cubic graphs with finite cyclic vertex connectivity larger than girth
- On regular induced subgraphs of generalized polygons
- Largest 2-regular subgraphs in 3-regular graphs
- On link-irregular graphs
- Mixed cages
- Rainbow connectivity using a rank genetic algorithm: Moore cages with girth six
- Biregular (and regular) planar cages
- Computational determination of (3,11) and (4,7) cages
- Mixed cages: monotonicity, connectivity and upper bounds
- An alternate description of a \((q + 1, 8)\)-cage
- Generalized cages
- Edge-girth-regular graphs
- Bipartite biregular Moore graphs
- On the non-existence of antipodal cages of even girth
- Codes for distributed storage from 3-regular graphs
- On the existence of (r, g, )-cages
- Petrie duality and the Anstee-Robertson graph
- A new bound for the connectivity of cages
- Extremal edge-girth-regular graphs
- Perfect matchings in highly cyclically connected regular graphs
- On the packing chromatic number of Moore graphs
- The signless Laplacian spectral radius of book-free graphs
- Regular Turán numbers of complete bipartite graphs
- Cyclic connectivity, edge-elimination, and the twisted Isaacs graphs
- Wheel and star-critical Ramsey numbers for quadrilateral
- Maximizing algebraic connectivity for certain families of graphs
- Improving bounds on the order of regular graphs of girth 5
- On the defect of vertex-transitive graphs of given degree and diameter
- Small graphs and hypergraphs of given degree and girth
- New small regular graphs of girth 5
- On mixed cages
- Graphs without a 3-connected subgraph are 4-colourable
- Recursive constructions of small regular graphs of given degree and girth
- Small-space spectral sparsification via bounded-independence sampling
- Edge-girth-regular graphs arising from biaffine planes and Suzuki groups
- Improved lower bound for differentially private facility location
- Families of small regular graphs of girth 5
- Online graph exploration: New results on old and new algorithms
- On the limitations of the use of solvable groups in Cayley graph cage constructions
- Finding small regular graphs of girths 6, 8 and 12 as subgraphs of cages
- A new upper bound for the traveling salesman problem in cubic graphs
- A trivalent graph of girth 17
- On decreasing the orders of (k,g)-graphs
- A connection between a question of Bermond and Bollobás and Ramanujan graphs
- Small bi-regular graphs of even girth
- On new record graphs close to bipartite Moore graphs
- A family of arc-transitive graphs of girth at least 5 admitting a Suzuki simple group
- Spectra of orders for \(k\)-regular graphs of girth \(g\)
- Adjacency matrices of polarity graphs and of other \(C_{4}\)-free graphs of large size
- Spectral sparsification via bounded-independence sampling
- Weighted cages
- On the excess of vertex-transitive graphs of given degree and girth
- Elliptic semiplanes and regular graphs with girth 5
- Flip colouring of graphs
- Isolating highly connected induced subgraphs
- On the automorphisms of a family of small q-regular graphs of girth 8
- Analogues of Bermond-Bollobás conjecture for cages yield expander families
- Partial linear spaces and identifying codes
- On links between G-graphs and lifts
- Polycyclic geometric realizations of the Gray configuration
- Minimum 2-percolating sets in 2-connected, diameter 2 graphs
- On networks with order close to the Moore bound
- Applications of integer programming methods to cages
- On upper bounds of odd girth cages
- On vertex-girth-regular graphs: (non-)existence, bounds and enumeration
This page was built for publication: Dynamic cage survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2378882)
