New small regular graphs of given girth: the cage problem and beyond
From MaRDI portal
Cites work
- A list of 4-valent 2-arc-transitive graphs and finite faithful amalgams of index (4, 2)
- A small trivalent graph of girth 14
- A smallest graph of girth 10 and valency 3
- A survey on the missing Moore graph
- A trivalent graph of girth ten
- A trivalent graph with 58 vertices and girth 9
- Applications of integer programming methods to cages
- Bounding the order of the vertex-stabiliser in 3-valent vertex-transitive and 4-valent arc-transitive graphs
- Cages—a survey
- Computational determination of (3,11) and (4,7) cages
- Cubic vertex-transitive graphs on up to 1280 vertices
- Dynamic cage survey
- Edge-girth-regular graphs
- Extremal edge-girth-regular graphs
- Extremal regular graphs and hypergraphs related to fractional repetition codes
- Generation of various classes of trivalent graphs
- House of graphs 2.0: a database of interesting graphs and more
- scientific article; zbMATH DE number 4208101 (Why is no real title available?)
- scientific article; zbMATH DE number 4006288 (Why is no real title available?)
- scientific article; zbMATH DE number 1303556 (Why is no real title available?)
- scientific article; zbMATH DE number 1750091 (Why is no real title available?)
- scientific article; zbMATH DE number 3256347 (Why is no real title available?)
- scientific article; zbMATH DE number 3414342 (Why is no real title available?)
- Minimal Regular Graphs of Girths Eight and Twelve
- New bounds for Ramsey numbers \(R ( K_k - e , K_l - e )\)
- New small trivalent graphs for girths 17,18 and 20
- On (k,g)-graphs without (g + 1)-cycles
- On the girth of voltage graph lifts
- On the smallest graph of girth 10 and valency 3
- On upper bounds of odd girth cages
- On vertex-girth-regular graphs: (non-)existence, bounds and enumeration
- Optimal network topologies: expanders, cages, Ramanujan graphs, entangled networks and all that
- Practical graph isomorphism. II.
- Quasi-cyclic LDPC codes of column-weight two using a search algorithm
- Regular Graphs with Given Girth and Restricted Circuits
- Secret sharing on large girth graphs
- Tabu Search—Part I
- The Gray graph is pseudo 2-factor isomorphic
- The sextet construction for cubic graphs
- The Smallest Cubic Graphs of Girth Nine
- Theoretical and computational approaches to determining sets of orders for (k, g)-graphs
- Triples and hexagons
- Voltage graphs, group presentations and cages
This page was built for publication: New small regular graphs of given girth: the cage problem and beyond
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7349260)
