7 papers
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…
HIST-Critical Graphs and Malkevitch's Conjecture
Jan Goedgebeur, Kenta Noguchi, Jarne Renders +1
In a given graph, a HIST is a spanning tree without -valent vertices. Motivated by developing a better understanding of HIST-free graphs, i.e. graphs containing no HIST, in this…
Network fault costs based on minimum leaf spanning trees
Jan Goedgebeur, Jarne Renders, Gábor Wiener +1
We study the fault-tolerance of networks from both the structural and computational point of view using the minimum leaf number of the corresponding graph , i.e. the minimum num…
The Frank number and nowhere-zero flows on graphs
Jan Goedgebeur, Edita MáÄajová, Jarne Renders
An edge of a graph is called deletable for some orientation if the restriction of to is a strong orientation. Inspired by a problem of Frank, in 2021 Hörsch…
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…