Conjectures on uniquely 3-edge-colorable graphs

zbMATH Open1376.05059MaRDI QIDQ4598356FDOQ4598356

Authors: Naoki Matsumoto 

Publication date: 20 December 2017

Recommendations

• scientific article; zbMATH DE number 1146229
• Uniquely edge-3-colorable graphs and snarks
• scientific article; zbMATH DE number 3878955
• The size of edge-critical uniquely 3-colorable planar graphs
• scientific article; zbMATH DE number 1439482

zbMATH Keywords

edge coloringcubicuniquely coloring

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Cited In (13)

• The size of edge-critical uniquely 3-colorable planar graphs
• Uniquely colorable graphs up to automorphisms
• Size of edge-critical uniquely 3-colorable planar graphs
• 3-consecutive edge coloring of a graph
• Triangle-free Uniquely 3-Edge Colorable Cubic Graphs
• Algebraic characterization of uniquely vertex colorable graphs
• Three measures of edge-uncolorability
• Bordeaux 3-color conjecture and 3-choosability
• Uniquely edge-3-colorable graphs and snarks
• Uniquely forced perfect matching and unique 3-edge-coloring
• 3-consecutive C-colorings of graphs
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: Conjectures on uniquely 3-edge-colorable graphs

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