| Publication | Date of Publication | Type |
|---|
A note on $\bar{X}$-coloring and $\hat{A}$-coloring 4-regular graphs
(available as arXiv preprint) | N/A | Paper |
Exhaustive generation of edge-girth-regular graphs
(available as arXiv preprint) | N/A | Paper |
Some Results on Critical ($P_5,H$)-free Graphs
(available as arXiv preprint) | N/A | Paper |
Minimal obstructions to C₅-coloring in hereditary graph classes
(available as arXiv preprint) | N/A | Paper |
New small regular graphs of given girth: the cage problem and beyond
The Electronic Journal of Combinatorics | 2026-09-16 | Paper |
Three-coloring triangle-free graphs without long forbidden paths
Theoretical Computer Science | 2026-08-21 | Paper |
The Gray graph is pseudo 2-factor isomorphic
Discrete Applied Mathematics | 2026-07-02 | Paper |
Minimal obstructions to C₅-coloring in hereditary graph classes
Information and Computation | 2026-06-11 | Paper |
There are finitely many 5-vertex-critical \((P_6, \mathrm{bull})\)-free graphs
Journal of Graph Theory | 2026-06-11 | Paper |
| Minimal obstructions to C₅-Coloring in hereditary graph classes | 2026-05-12 | Paper |
Vertex-critical (P₅, W₄)-free graphs
Theoretical Computer Science | 2026-05-11 | Paper |
Counterexamples to conjectures on the occupancy fraction of graphs
Mathematics of Computation | 2026-04-14 | Paper |
On vertex-girth-regular graphs: (non-)existence, bounds and enumeration
The Electronic Journal of Combinatorics | 2026-02-04 | Paper |
| Vertex-critical (P₅,W₄)-free graphs | 2026-01-28 | Paper |
Colouring Graphs Without a Subdivided H-Graph: A Full Complexity Classification
(available as arXiv preprint) | 2026-01-01 | Paper |
A non-existence result for vertex-girth-regular graphs
(available as arXiv preprint) | 2026-01-01 | Paper |
Vertex-critical $(P_5,\text{chair})$-free and $(P_5,\text{cricket})$-free graphs
(available as arXiv preprint) | 2026-01-01 | Paper |
Counting Hamiltonian paths between prescribed vertices in traceable graphs with a forbidden induced subgraph
(available as arXiv preprint) | 2026-01-01 | Paper |
On the number of perfect matchings in planar graphs
(available as arXiv preprint) | 2026-01-01 | Paper |
A human-checkable proof of the 112-vertex counterexample to the Petersen coloring conjecture
(available as arXiv preprint) | 2026-01-01 | Paper |
Counterexamples to the Albertson-Berman conjecture: minimum order, connectivity and an improved ratio bound
(available as arXiv preprint) | 2026-01-01 | Paper |
On (k,g)-graphs without (g + 1)-cycles
Applied Mathematics and Computation | 2025-10-14 | Paper |
On the girth and connectivity of cubic graphs with a unique longest cycle
Discrete Mathematics | 2025-09-04 | Paper |
Some results on critical (P₅, H)-free graphs
Theoretical Computer Science | 2025-08-01 | Paper |
| Some results on critical (P₅,H)-free graphs | 2025-06-17 | Paper |
The maximum number of connected sets in regular graphs
The Electronic Journal of Combinatorics | 2025-03-06 | Paper |
Critical \(( P_5 , \mathrm{dart} )\)-free graphs
Discrete Applied Mathematics | 2025-02-28 | Paper |
Critical (P₅,W₄)-Free Graphs
(available as arXiv preprint) | 2025-01-01 | Paper |
Sharp results for the Erdős, Pach, Pollack and Tuza problem
(available as arXiv preprint) | 2025-01-01 | Paper |
The Gray graph is pseudo 2-factor isomorphic
(available as arXiv preprint) | 2025-01-01 | Paper |
There are finitely many $5$-vertex-critical $(P_6,\text{bull})$-free graphs
(available as arXiv preprint) | 2025-01-01 | Paper |
On a conjecture of Faudree and Schelp
(available as arXiv preprint) | 2025-01-01 | Paper |
Counting Small Cycle Double Covers
(available as arXiv preprint) | 2025-01-01 | Paper |
Improved lower bounds on the maximum size of graphs with girth 5
(available as arXiv preprint) | 2025-01-01 | Paper |
On the extrema of the mean subtree order of graphs
(available as arXiv preprint) | 2025-01-01 | Paper |
Computer-assisted graph theory: a survey
(available as arXiv preprint) | 2025-01-01 | Paper |
New small regular graphs of given girth: the cage problem and beyond
(available as arXiv preprint) | 2025-01-01 | Paper |
On the order-diameter ratio of girth-diameter cages
(available as arXiv preprint) | 2025-01-01 | Paper |
Three-coloring triangle-free graphs without long forbidden paths
(available as arXiv preprint) | 2025-01-01 | Paper |
On graphs isomorphic with their conduction graph
MATCH - Communications in Mathematical and in Computer Chemistry | 2024-10-31 | Paper |
| Critical \((P_5,\mathit{dart})\)-free graphs | 2024-09-16 | Paper |
Few Hamiltonian cycles in graphs with one or two vertex degrees
Mathematics of Computation | 2024-08-21 | Paper |
Improved asymptotic upper bounds for the minimum number of longest cycles in regular graphs
Discrete Applied Mathematics | 2024-08-09 | Paper |
A note on \(\bar{X}\)-coloring and \(\hat{A}\)-coloring 4-regular graphs
Discrete Mathematics | 2024-05-21 | Paper |
On vertex-girth-regular graphs: (Non-)existence, bounds and enumeration
(available as arXiv preprint) | 2024-01-01 | Paper |
Cubic graphs of given girth and connectivity with a unique longest cycle
(available as arXiv preprint) | 2024-01-01 | Paper |
Computational methods for finding bi-regular cages
(available as arXiv preprint) | 2024-01-01 | Paper |
On (k,g)-Graphs without (g+1)-Cycles
(available as arXiv preprint) | 2024-01-01 | Paper |
| Counterexamples to conjectures on the occupancy fraction of graphs | 2023-11-09 | Paper |
| The maximum number of connected sets in regular graphs | 2023-10-31 | Paper |
| Improved asymptotic upper bounds for the minimum number of pairwise distinct longest cycles in regular graphs | 2023-10-26 | Paper |
| Critical (P₅,dart)-Free Graphs | 2023-08-07 | Paper |
Features for the 0-1 knapsack problem based on inclusionwise maximal solutions
European Journal of Operational Research | 2023-07-11 | Paper |
Features for the 0-1 knapsack problem based on inclusionwise maximal solutions
European Journal of Operational Research | 2023-07-11 | Paper |
Counterexamples to conjectures on the occupancy fraction of graphs
(available as arXiv preprint) | 2023-01-01 | Paper |
Evolving test instances of the Hamiltonian completion problem
Computers & Operations Research | 2022-12-19 | Paper |
Exploring search space trees using an adapted version of Monte Carlo tree search for combinatorial optimization problems
Computers & Operations Research | 2022-12-19 | Paper |
| Few hamiltonian cycles in graphs with one or two vertex degrees | 2022-11-15 | Paper |
A new class of hard problem instances for the 0-1 knapsack problem
European Journal of Operational Research | 2022-05-20 | Paper |
Exploring search space trees using an adapted version of Monte Carlo tree search for combinatorial optimization problems
(available as arXiv preprint) | 2020-10-22 | Paper |
