AbstractIn 1957, Kotzig proved that the line graph of a snark (non edge-3-colorable cubic graph) is a 4-coloring-snark (non edge-4-colorable 4-regular graph). In this paper we present a reverse construction, i.e., we construct snarks from 4-coloring-snarks. In a similar way, we construct graphs without nowhere-zero 3-flows from snarks
AbstractUsing multi-terminal networks we build methods on constructing graphs without nowhere-zero g...
In this paper we survey recent results and problems of both theoretical and algorithmic character on...
Vizing’s theorem tells us that cubic graphs are edge-colorable by either 3 or 4 colors. Graphs for w...
We report the most relevant results on the classification, up to isomorphism, of nontrivial simple u...
There are several methods for constructing snarks (cubic graphs with chromatic index 4). We study th...
We discuss the construction of snarks (that is, cyclically 4-edge connected cubic graphs of girth at...
This work deals with the construction of snarks, that is, cubic graphs that cannot be 3-edge-colored...
For a number of unsolved problems in graph theory such as the cycle double cover conjecture, Fulkers...
AbstractIn this paper vertex-reductions of snarks are considered. Each reduction naturally divides t...
Abstract: An edge colouring of a graph is an assignment of labels (colours) to the edges of a graph ...
A snark is a bridgeless cubic graph which is not 3-edge-colourable. The oddness of a bridgeless cubi...
There are many hard conjectures in graph theory, like Tutte’s 5-flow conjecture, and the 5-cycle dou...
Bicritical snarks are the irreducible ones with respect to the reductions considered by Nedela and ...
Abstract. For many of the unsolved problems concerning cycles and matchings in graphs it is known th...
International audienceA snark is a cyclically-4-edge-connected cubic graph with chromatic index 4. I...
AbstractUsing multi-terminal networks we build methods on constructing graphs without nowhere-zero g...
In this paper we survey recent results and problems of both theoretical and algorithmic character on...
Vizing’s theorem tells us that cubic graphs are edge-colorable by either 3 or 4 colors. Graphs for w...
We report the most relevant results on the classification, up to isomorphism, of nontrivial simple u...
There are several methods for constructing snarks (cubic graphs with chromatic index 4). We study th...
We discuss the construction of snarks (that is, cyclically 4-edge connected cubic graphs of girth at...
This work deals with the construction of snarks, that is, cubic graphs that cannot be 3-edge-colored...
For a number of unsolved problems in graph theory such as the cycle double cover conjecture, Fulkers...
AbstractIn this paper vertex-reductions of snarks are considered. Each reduction naturally divides t...
Abstract: An edge colouring of a graph is an assignment of labels (colours) to the edges of a graph ...
A snark is a bridgeless cubic graph which is not 3-edge-colourable. The oddness of a bridgeless cubi...
There are many hard conjectures in graph theory, like Tutte’s 5-flow conjecture, and the 5-cycle dou...
Bicritical snarks are the irreducible ones with respect to the reductions considered by Nedela and ...
Abstract. For many of the unsolved problems concerning cycles and matchings in graphs it is known th...
International audienceA snark is a cyclically-4-edge-connected cubic graph with chromatic index 4. I...
AbstractUsing multi-terminal networks we build methods on constructing graphs without nowhere-zero g...
In this paper we survey recent results and problems of both theoretical and algorithmic character on...
Vizing’s theorem tells us that cubic graphs are edge-colorable by either 3 or 4 colors. Graphs for w...
DOI
Add to ORKG