A survey on snarks and new results: Products, reducibility and a computer search

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0118(199806)28:2<57::AID-JGT1>3.0.CO;2-D" /><57::AID-JGT1>3.0.CO;2-D 10.1002/(SICI)1097-0118(199806)28:2<57::AID-JGT1>3.0.CO;2-DzbMath0929.05030OpenAlexW4241527888MaRDI QIDQ4242970

Mauro Meschiari, Fulvia Spaggiari, Beatrice Ruini, Alberto Cavicchioli

Publication date: 11 January 2000

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199806)28:2<57::aid-jgt1>3.0.co;2-d

zbMATH Keywords

girthsnarkchromatic indexcyclic edge-connectivity

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40)

Related Items (11)

Improved edge-coloring with three colors ⋮ Edge-colourings of cubic graphs admitting a solvable vertex-transitive group of automorphisms ⋮ Generation and properties of snarks ⋮ Snarks and flow-snarks constructed from coloring-snarks. ⋮ Fulkerson's conjecture and Loupekine snarks ⋮ On maximum \(k\)-edge-colorable subgraphs of bipartite graphs ⋮ Double covers of cubic graphs with oddness 4 ⋮ Cycle double covers and spanning minors. I ⋮ Berge-Fulkerson conjecture on certain snarks ⋮ Equivalence of Fleischner's and Thomassen's conjectures ⋮ Morphology of small snarks

This page was built for publication: A survey on snarks and new results: Products, reducibility and a computer search