prof. dr. Jan Goedgebeur
Show
Sort by
-
On minimal triangle‐free 6‐chromatic graphs
-
Graphs with few hamiltonian cycles
-
Colourings of cubic graphs inducing isomorphic monochromatic subgraphs
-
On the minimum leaf number of cubic graphs
-
- Journal Article
- A1
- open access
Bounds for the smallest k-chromatic graphs of given girth
-
- Journal Article
- A1
- open access
Smallest snarks with oddness 4 and cyclic connectivity 4 have order 44
-
- Journal Article
- A1
- open access
On almost hypohamiltonian graphs
-
- Journal Article
- A1
- open access
Directed networks as a novel way to describe and analyze cardiac excitation : directed graph mapping
-
A note on 2-bisections of claw-free cubic graphs
-
- Journal Article
- A1
- open access
On the smallest snarks with oddness 4 and connectivity 2