Jorik Jooken

From MaRDI portal
Person:2108107


List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
On graphs isomorphic with their conduction graph
MATCH - Communications in Mathematical and in Computer Chemistry
2024-10-31Paper
Critical \((P_5,\mathit{dart})\)-free graphs
 
2024-09-16Paper
Few Hamiltonian cycles in graphs with one or two vertex degrees
Mathematics of Computation
2024-08-21Paper
Improved asymptotic upper bounds for the minimum number of longest cycles in regular graphs
Discrete Applied Mathematics
2024-08-09Paper
A note on \(\bar{X}\)-coloring and \(\hat{A}\)-coloring 4-regular graphs
Discrete Mathematics
2024-05-21Paper
Counterexamples to conjectures on the occupancy fraction of graphs
 
2023-11-09Paper
The maximum number of connected sets in regular graphs
 
2023-10-31Paper
Improved asymptotic upper bounds for the minimum number of pairwise distinct longest cycles in regular graphs
 
2023-10-26Paper
Critical $(P_5,dart)$-Free Graphs
 
2023-08-07Paper
Features for the 0-1 knapsack problem based on inclusionwise maximal solutions
European Journal of Operational Research
2023-07-11Paper
Evolving test instances of the Hamiltonian completion problem
Computers \& Operations Research
2022-12-19Paper
Exploring search space trees using an adapted version of Monte Carlo tree search for combinatorial optimization problems
Computers \& Operations Research
2022-12-19Paper
Few hamiltonian cycles in graphs with one or two vertex degrees
 
2022-11-15Paper
A new class of hard problem instances for the 0-1 knapsack problem
European Journal of Operational Research
2022-05-20Paper
Exploring search space trees using an adapted version of Monte Carlo tree search for combinatorial optimization problems
 
2020-10-22Paper
A note on $\bar{X}$-coloring and $\hat{A}$-coloring 4-regular graphs
 
N/APaper
Exhaustive generation of edge-girth-regular graphs
 
N/APaper
Some Results on Critical ($P_5,H$)-free Graphs
 
N/APaper
Minimal obstructions to $C_5$-coloring in hereditary graph classes
 
N/APaper


Research outcomes over time


This page was built for person: Jorik Jooken