Show
Sort by
-
- Journal Article
- A1
- open access
Generation and new infinite families of K2-hypohamiltonian graphs
-
- Journal Article
- A1
- open access
K2-Hamiltonian graphs : II
-
Critical (P5,dart)-free graphs
-
- Conference Paper
- C1
- open access
Minimal obstructions to C₅-coloring in hereditary graph classes
-
- 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
Few hamiltonian cycles in graphs with one or two vertex degrees
-
- Journal Article
- A1
- open access
Colouring graphs with no induced six-vertex path or diamond
-
- Journal Article
- A1
- open access
House of Graphs 2.0 : a database of interesting graphs and more
-
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
The minimality of the Georges-Kelmans graph
-
- Journal Article
- A1
- open access
Switching 3-edge-colorings of cubic graphs
-
New bounds for Ramsey numbers R(Kk−e,Kl−e)
-
- Journal Article
- A1
- open access
Better 3-coloring algorithms : excluding a triangle and a seven vertex path
-
- Journal Article
- A1
- open access
k-Critical graphs in P5-free graphs
-
- Journal Article
- A1
- open access
Evaluation of directed graph-mapping in complex atrial tachycardias
-
A unified approach to construct snarks with circular flow number 5
-
Colouring graphs with no induced six-vertex path or diamond
-
The smallest nontrivial snarks of oddness 4
-
On minimal triangle‐free 6‐chromatic graphs
-
Obstructions for three-coloring graphs without induced paths on six vertices
-
- Journal Article
- A1
- open access
Existence of regular nut graphs for degree at most 11
-
Graphs with few hamiltonian cycles
-
- Journal Article
- A1
- open access
Obstructions for three-coloring and list three-coloring H-free graphs
-
Computational results and new bounds for the circular flow number of snarks
-
- Journal Article
- A2
- open access
Large independent sets in triangle-free cubic graphs : beyond planarity
-
k-Critical graphs in P5-free graphs
-
Structural and computational results on platypus graphs
-
- Journal Article
- A1
- open access
Directed networks as a novel way to describe and analyze cardiac excitation : directed graph mapping
-
- Journal Article
- A1
- open access
Smallest snarks with oddness 4 and cyclic connectivity 4 have order 44
-
- Journal Article
- A1
- open access
Bounds for the smallest k-chromatic graphs of given girth
-
On the minimum leaf number of cubic graphs
-
Colourings of cubic graphs inducing isomorphic monochromatic subgraphs
-
- Journal Article
- A1
- open access
On almost hypohamiltonian graphs
-
Generation and properties of nut graphs
-
- Journal Article
- A1
- open access
On the smallest snarks with oddness 4 and connectivity 2
-
A note on 2-bisections of claw-free cubic graphs
-
Exhaustive generation of k-critical H-free graphs
-
Infinitely many planar cubic hypohamiltonian graphs of girth 5
-
- Journal Article
- A1
- open access
On hypohamiltonian snarks and a theorem of Fiorini
-
Generation of cubic graphs and snarks with large girth
-
- Journal Article
- A1
- open access
Improved bounds for hypohamiltonian graphs
-
Obstructions for three-coloring graphs with one forbidden induced subgraph
-
Exhaustive generation of k-critical H-free graphs
-
Recursive generation of IPR fullerenes
-
A counterexample to the pseudo 2-factor isomorphic graph conjecture
-
Fullerenes with distant pentagons
-
House of Graphs: a database of interesting graphs
-
Generation and properties of snarks