189 citations · 506 across the 54 of their papers we have counts for
10 papers · 1 filter
Infinite families of planar graphs of a given injective chromatic number
Matias Daneels, Jan Goedgebeur, Jarne Renders
An injective colouring of a graph is a colouring in which every two vertices sharing a common neighbour receive a different colour. Chen, Hahn, Raspaud and Wang conjectured that ev…
Computational methods for finding bi-regular cages
Jan Goedgebeur, Jorik Jooken, Tibo Van den Eede
An -graph is a (simple, undirected) graph of girth with vertices of degrees and where . Given , we seek the -graphs…
Generation of Cycle Permutation Graphs and Permutation Snarks
Jan Goedgebeur, Jarne Renders, Steven Van Overberghe
We present an algorithm for the efficient generation of all pairwise non-isomorphic cycle permutation graphs, i.e. cubic graphs with a -factor consisting of two chordless cycles…
On the existence of factors intersecting sets of cycles in regular graphs
Jan Goedgebeur, Davide Mattiolo, Giuseppe Mazzuoccolo +3
A recent result by Kardoš, Máčajová and Zerafa [J. Comb. Theory, Ser. B. 160 (2023) 1--14] related to the famous Berge-Fulkerson conjecture implies that given an arbitrary set of o…
On graphs isomorphic with their conduction graph
Aidan Birkinshaw, Patrick W. Fowler, Jan Goedgebeur +1
Conduction graphs are defined here in order to elucidate at a glance the often complicated conduction behaviour of molecular graphs as ballistic molecular conductors. The graph $G^…
Minimal obstructions to -coloring in hereditary graph classes
Jan Goedgebeur, Jorik Jooken, Karolina Okrasa +2
For graphs and , an -coloring of is an edge-preserving mapping from to . Note that if is the triangle, then -colorings are equivalent to -color…