Show
Sort by
-
- Journal Article
- A1
- open access
K2-Hamiltonian graphs : II
-
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 -
A unified approach to construct snarks with circular flow number 5
-
- Journal Article
- A1
- open access
K-2-Hamiltonian graphs : I
-
The smallest nontrivial snarks of oddness 4
-
Computational results and new bounds for the circular flow number of snarks
-
- Journal Article
- A1
- open access
Smallest snarks with oddness 4 and cyclic connectivity 4 have order 44
-
Colourings of cubic graphs inducing isomorphic monochromatic subgraphs
-
- Journal Article
- A1
- open access
On hypohamiltonian snarks and a theorem of Fiorini
-
Generation of cubic graphs and snarks with large girth