Uniquely edge-3-colorable graphs and snarks

DOI10.1007/PL00007221zbMATH Open0966.05027MaRDI QIDQ1586579FDOQ1586579

Cun-Quan Zhang, John Goldwasser

Publication date: 12 August 2001

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Recommendations

• scientific article; zbMATH DE number 1146229
• Generation and properties of snarks
• Snarks without small cycles
• Conjectures on uniquely 3-edge-colorable graphs
• On snarks that are far from being 3-edge colorable

zbMATH Keywords

snarkuniquely edge-3-colorable

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)

Cited In (3)

• On purely tree-colorable planar graphs
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: Uniquely edge-3-colorable graphs and snarks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1586579)