Cover Image

New small regular graphs of given girth: the cage problem and beyond

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Exoo, Geoffrey, Goedgebeur, Jan, Jooken, Jorik, Stubbe, Louis, Eede, Tibo Van den
Format:	Preprint
Published:	2025
Subjects:	Combinatorics Discrete Mathematics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

On the order-diameter ratio of girth-diameter cages
by: Cambie, Stijn, et al.
Published: (2025)

Improved lower bounds on the maximum size of graphs with girth 5
by: Goedgebeur, Jan, et al.
Published: (2025)

Computational methods for finding bi-regular cages
by: Goedgebeur, Jan, et al.
Published: (2024)

The Gray graph is pseudo 2-factor isomorphic
by: Abreu, Marien, et al.
Published: (2025)

Computer-assisted graph theory: a survey
by: Jooken, Jorik
Published: (2025)

Exhaustive generation of edge-girth-regular graphs
by: Goedgebeur, Jan, et al.
Published: (2024)

On $(k,g)$-Graphs without $(g+1)$-Cycles
by: Eze, Leonard Chidiebere, et al.
Published: (2024)

On the existence of factors intersecting sets of cycles in regular graphs
by: Goedgebeur, Jan, et al.
Published: (2024)

The Frank number and nowhere-zero flows on graphs
by: Goedgebeur, Jan, et al.
Published: (2023)

Generation of Cycle Permutation Graphs and Permutation Snarks
by: Goedgebeur, Jan, et al.
Published: (2024)

Distance-based (and path-based) covering problems for graphs of given cyclomatic number
by: Chakraborty, Dibyayan, et al.
Published: (2025)

Lower bounding the MaxCut of high girth 3-regular graphs using the QAOA
by: Farhi, Edward, et al.
Published: (2025)

2-distance 4-coloring of planar subcubic graphs with girth at least 21
by: La, Hoang, et al.
Published: (2021)

Tree-partitions of graphs with given pathwidth
by: Wood, David R.
Published: (2026)

Network fault costs based on minimum leaf spanning trees
by: Goedgebeur, Jan, et al.
Published: (2025)

HIST-Critical Graphs and Malkevitch's Conjecture
by: Goedgebeur, Jan, et al.
Published: (2024)

On rigid regular graphs and a problem of Babai and Pultr
by: Knauer, Kolja, et al.
Published: (2025)

Knowledge management in House of Graphs
by: Devillez, Gauvain, et al.
Published: (2026)

A non-existence result for vertex-girth-regular graphs
by: Jooken, Jorik, et al.
Published: (2026)

Determining a graph from its reconfiguration graph
by: Berthe, Gaétan, et al.
Published: (2025)

Colouring Graphs Without a Subdivided H-Graph: A Full Complexity Classification
by: Eagling-Vose, Tala, et al.
Published: (2025)

Playing Sudoku on random 3-regular graphs
by: Dippel, Jack, et al.
Published: (2025)

On cuts of small chromatic number in sparse graphs
by: Aubian, Guillaume, et al.
Published: (2025)

Approximating temporal modularity on graphs of small underlying treewidth
by: Agdur, Vilhelm, et al.
Published: (2025)

Computational complexity of covering regular trees
by: Bok, Jan, et al.
Published: (2025)

Long induced paths in sparse graphs and graphs with forbidden patterns
by: Duron, Julien, et al.
Published: (2024)

On vertex-girth-regular graphs: (Non-)existence, bounds and enumeration
by: Jajcay, Robert, et al.
Published: (2024)

The tripartite-circle crossing number of graphs with two small partition classes
by: Camacho, Charles, et al.
Published: (2021)

Infinite families of planar graphs of a given injective chromatic number
by: Daneels, Matias, et al.
Published: (2024)

Canonical labelling of random regular graphs
by: Isaev, Mikhail, et al.
Published: (2026)

On three domination-based identification problems in block graphs
by: Chakraborty, Dipayan, et al.
Published: (2018)

Circular chromatic index of small graphs
by: Mazák, Ján, et al.
Published: (2026)

Filling some gaps on the edge coloring problem of split graphs
by: Couto, Fernanda, et al.
Published: (2024)

The sandwich problem for odd-hole-free and even-hole-free graphs
by: Cameron, Kathie, et al.
Published: (2024)

EPPA numbers of graphs
by: Bradley-Williams, David, et al.
Published: (2023)

Profile and neighbourhood complexity of graphs excluding a minor and tree-structured graphs
by: Beaudou, Laurent, et al.
Published: (2025)

Cops and robber in graphs with bounded vertex cover number
by: Bose, Prosenjit, et al.
Published: (2026)

List homomorphisms to separable signed graphs
by: Bok, Jan, et al.
Published: (2023)

Hamiltonian path and Hamiltonian cycle are solvable in polynomial time in graphs of bounded independence number
by: Jedličková, Nikola, et al.
Published: (2023)

On the expressive power of $2$-edge-colourings of graphs
by: Bok, Jan, et al.
Published: (2025)