scientific article; zbMATH DE number 568843
From MaRDI portal
Publication:4294635
zbMATH Open0792.05057MaRDI QIDQ4294635FDOQ4294635
Publication date: 24 July 1994
Title of this publication is not available (Why is that?)
Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph theory (05C99)
Cited In (19)
- The k-conversion number of regular graphs
- The Continuing Saga of Snarks
- Superposition of snarks revisited
- Fulkerson's conjecture and Loupekine snarks
- Berge-Fulkerson conjecture on certain snarks
- Berge-Fulkerson coloring for some families of superposition snarks
- Even cycles and even 2-factors in the line graph of a simple graph
- Classification and characterizations of snarks
- Rotationally symmetric snarks from voltage graphs
- Computational results and new bounds for the circular flow number of snarks
- Perfect pseudo-matchings in cubic graphs
- Superposition and constructions of graphs without nowhere-zero \(k\)-flows
- On the pebbling numbers of flower, Blanuša and Watkins snarks
- Asymptotic lower bounds on circular chromatic index of snarks
- Title not available (Why is that?)
- The hunting of the SNARK
- On coloring problems of snark families
- The Fan–Raspaud conjecture: A randomized algorithmic approach and application to the pair assignment problem in cubic networks
- Cubic graphs with colouring defect 3
Recommendations
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)