Jorik Jooken

activity

20192026

most citedExploring search space trees using an adapted version of Monte Carlo tree search for combinatorial optimization problems

18 citations · 31 across the 33 of their papers we have counts for

collaborators

Showing 2024Show all

9 papers · 1 filter

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 $(k, g)$ -Graphs without $(g + 1)$ -Cycles

Leonard Chidiebere Eze, Robert Jajcay, Jorik Jooken

A $(k, g, g + 1)$ -graph is a $k$ -regular graph of girth $g$ which does not contain cycles of length $g + 1$ . Such graphs are known to exist for all parameter pairs $k \geq 3,…

math.CO2024★ 1 cited

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^…

math.CO2024

On the girth and connectivity of cubic graphs with a unique longest cycle

Jorik Jooken, Carol T. Zamfirescu

We show that there exists an infinite family of cubic $2$ -connected non-hamiltonian graphs with girth $5$ containing a unique longest cycle.

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

Minimal obstructions to $C_{5}$ -coloring in hereditary graph classes

Jan Goedgebeur, Jorik Jooken, Karolina Okrasa +2

For graphs $G$ and $H$ , an $H$ -coloring of $G$ is an edge-preserving mapping from $V (G)$ to $V (H)$ . Note that if $H$ is the triangle, then $H$ -colorings are equivalent to $3$ -color…

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.CO2024★ 1 cited

Exhaustive generation of edge-girth-regular graphs

Jan Goedgebeur, Jorik Jooken

Edge-girth-regular graphs (abbreviated as $e g r$ graphs) are a class of highly regular graphs. More specifically, for integers $v$ , $k$ , $g$ and $λ$ an $e g r (v, k, g, λ)$ graph is a $k$ …

Computational methods for finding bi-regular cages

On (k,g)-Graphs without (g+1)-Cycles

On graphs isomorphic with their conduction graph

On the girth and connectivity of cubic graphs with a unique longest cycle

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

Minimal obstructions to C5​-coloring in hereditary graph classes

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

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

Exhaustive generation of edge-girth-regular graphs

On $(k, g)$ -Graphs without $(g + 1)$ -Cycles

Minimal obstructions to $C_{5}$ -coloring in hereditary graph classes

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

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