prof. dr. Jan Goedgebeur
- ORCID iD
-
0000-0001-8984-2463
Show
Sort by
-
- Conference Paper
- C1
- open access
Minimal obstructions to C₅-coloring in hereditary graph classes
-
Critical (P5,dart)-free graphs
-
- Journal Article
- A1
- open access
On non-Hamiltonian polyhedra without cubic vertices and their vertex-deleted subgraphs
-
- Journal Article
- A1
- open access
A heuristic algorithm using tree decompositions for the maximum happy vertices problem
-
- Journal Article
- A1
- open access
K2-Hamiltonian graphs : II
-
- Journal Article
- A1
- open access
Few hamiltonian cycles in graphs with one or two vertex degrees
-
- Journal Article
- A1
- open access
Generation and new infinite families of K2-hypohamiltonian graphs
-
On the Frank number and nowhere-zero flows on graphs
(2023) GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, WG 2023. In Lecture Notes in Computer Science 14093. p.363-375 -
- Journal Article
- A1
- open access
Some results on k-critical P5-free graphs
-
- Journal Article
- A1
- open access
Colouring graphs with no induced six-vertex path or diamond