prof. dr. Jan Goedgebeur
- ORCID iD
-
0000-0001-8984-2463
Show
Sort by
-
Vertex-critical (P5, W4)-free graphs
(2026) COMPUTING AND COMBINATORICS, COCOON 2025, PT II. In Lecture Notes in Computer Science 15984. p.139-152 -
Some results on critical (P5, H)-free graphs
(2025) COMPUTING AND COMBINATORICS, COCOON 2024, PT I. In Lecture Notes in Computer Science 15161. p.433-444 -
Generation of cycle permutation graphs and permutation snarks
-
- Journal Article
- A1
- open access
On graphs isomorphic with their conduction graph
-
- Journal Article
- A1
- open access
Some results on critical (P5, H)-free graphs
-
- Journal Article
- A1
- open access
The maximum number of connected sets in regular graphs
-
- Journal Article
- A1
- open access
The Frank number and nowhere-zero flows on graphs
-
- Journal Article
- A1
- open access
Critical (P5, dart)-free graphs
-
- Conference Paper
- C1
- open access
Minimal obstructions to C₅-coloring in hereditary graph classes
-
Critical (P5,dart)-free graphs