scientific article; zbMATH DE number 568843
From MaRDI portal
Publication:4294635
Recommendations
Cited in
(20)- Cubic graphs with colouring defect 3
- The k-conversion number of regular graphs
- The Fan-Raspaud conjecture: a randomized algorithmic approach and application to the pair assignment problem in cubic networks
- The Continuing Saga of Snarks
- Superposition of snarks revisited
- Snark designs
- Fulkerson's conjecture and Loupekine snarks
- Berge-Fulkerson conjecture on certain snarks
- Berge-Fulkerson coloring for some families of superposition snarks
- Classification and characterizations of snarks
- Even cycles and even 2-factors in the line graph of a simple graph
- Rotationally symmetric snarks from voltage graphs
- Computational results and new bounds for the circular flow number of snarks
- Superposition and constructions of graphs without nowhere-zero k-flows
- Perfect pseudo-matchings in cubic graphs
- Asymptotic lower bounds on circular chromatic index of snarks
- On the pebbling numbers of flower, Blanuša and Watkins snarks
- The hunting of the SNARK
- scientific article; zbMATH DE number 4093509 (Why is no real title available?)
- On coloring problems of snark families
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4294635)