Jorik Jooken

collaborators

5 papers

math.CO2024

Computational methods for finding bi-regular cages

Jan Goedgebeur, Jorik Jooken, Tibo Van den Eede

An $({r, m}; g)$ -graph is a (simple, undirected) graph of girth $g \geq 3$ with vertices of degrees $r$ and $m$ where $2 \leq r < m$ . Given $r, m, g$ , we seek the $({r, m}; g)$ -graphs…

math.CO2024

On vertex-girth-regular graphs: (Non-)existence, bounds and enumeration

Robert Jajcay, Jorik Jooken, István Porupsánszki

A vertex-girth-regular $v g r (v, k, g, λ)$ -graph is a $k$ -regular graph of girth $g$ and order $v$ in which every vertex belongs to exactly $λ$ cycles of length $g$ . While all vertex-tr…

math.CO2024

Some Results on Critical ( $P_{5}, H$ )-free Graphs

Wen Xia, Jorik Jooken, Jan Goedgebeur +1

Given two graphs $H_{1}$ and $H_{2}$ , a graph is $(H_{1}, H_{2})$ -free if it contains no induced subgraph isomorphic to $H_{1}$ nor $H_{2}$ . A graph $G$ is $k$ -vertex-critical if every proper i…

math.CO2024

A note on $X ˉ$ -coloring and $A^$ -coloring 4-regular graphs

Jorik Jooken

Let $\partial_{H} (u)$ be the set of edges incident with a vertex $u$ in the graph $H$ . We say that a graph $G$ is $H$ -colorable if there exist total functions $f : E(G) \rightarrow E…

math.CO2023

Improved asymptotic upper bounds for the minimum number of pairwise distinct longest cycles in regular graphs

Jorik Jooken

We study how few pairwise distinct longest cycles a regular graph can have under additional constraints. For each integer $r \geq 5$ , we give exponential improvements for the best…

Computational methods for finding bi-regular cages

On vertex-girth-regular graphs: (Non-)existence, bounds and enumeration

Some Results on Critical (P5​,H)-free Graphs

A note on Xˉ-coloring and A^-coloring 4-regular graphs

Improved asymptotic upper bounds for the minimum number of pairwise distinct longest cycles in regular graphs

Some Results on Critical ( $P_{5}, H$ )-free Graphs

A note on $X ˉ$ -coloring and $A^$ -coloring 4-regular graphs