Recommendations
Cites work
- scientific article; zbMATH DE number 3654142 (Why is no real title available?)
- scientific article; zbMATH DE number 3677862 (Why is no real title available?)
- scientific article; zbMATH DE number 1146229 (Why is no real title available?)
- scientific article; zbMATH DE number 3349917 (Why is no real title available?)
- A note on a matrix criterion for unique colorability of a signed graph
- Acyclic colorings of planar graphs
- Cubic graphs with three Hamiltonian cycles are not always uniquely edge colorable
- Geometric coloring theory
- Graph theory
- Hamiltonian Cycles and Uniquely Edge Colourable Graphs
- Hamiltonian weights and unique 3‐edge‐colorings of cubic graphs
- ON THE CHROMATIC INDEX OF A GRAPH, III: UNIQUELY EDGE-COLOURABLE GRAPHS
- On the coloring of signed graphs
- The four-colour theorem
- Uniquely Line Colorable Graphs
- Uniquely edge-3-colorable graphs and snarks
Cited in
(3)
This page was built for publication: On purely tree-colorable planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q280945)