scientific article; zbMATH DE number 1737273

zbMath0985.05022MaRDI QIDQ4529551

Eckhard Steffen

Publication date: 5 May 2002

Full work available at URL: https://eudml.org/doc/34532

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

edge coloringcubic graphsnark

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (7)

Infinitely many hypohamiltonian cubic graphs of girth 7 ⋮ Critical and flow-critical snarks coincide ⋮ Measures of edge-uncolorability of cubic graphs ⋮ 6-decomposition of snarks ⋮ Irreducible snarks of given order and cyclic connectivity ⋮ Hypohamiltonian Snarks with Cyclic Connectivity 5 and 6 ⋮ Exponentially many hypohamiltonian snarks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Construction of class two graphs with maximum vertex degree three
• Classification and characterizations of snarks
• Decomposition of snarks
• Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable
• Decompositions and reductions of snarks

This page was built for publication: