scientific article; zbMATH DE number 7145382
From MaRDI portal
Publication:5206906
Recommendations
- Triad colorings of triangulations on closed surfaces
- Coloring triangle-free graphs on surfaces
- Coloring Triangle-Free Graphs on Surfaces
- Three-coloring triangle-free graphs on surfaces. VII. A linear-time algorithm
- Three-coloring triangle-free graphs on surfaces. I: Extending a coloring to a disk with one triangle.
- Three-coloring triangle-free graphs on surfaces. III. Graphs of girth five
- 3-Coloring graphs embedded in surfaces
- Three-coloring triangle-free graphs on surfaces. V: Coloring planar graphs with distant anomalies
- Three-coloring graphs embedded on surfaces with all faces even-sided
- On uniquely 3-colorable graphs
Cites work
- scientific article; zbMATH DE number 3924805 (Why is no real title available?)
- scientific article; zbMATH DE number 3654142 (Why is no real title available?)
- scientific article; zbMATH DE number 3540826 (Why is no real title available?)
- scientific article; zbMATH DE number 821271 (Why is no real title available?)
- scientific article; zbMATH DE number 863472 (Why is no real title available?)
- scientific article; zbMATH DE number 870137 (Why is no real title available?)
- scientific article; zbMATH DE number 6433827 (Why is no real title available?)
- scientific article; zbMATH DE number 3395930 (Why is no real title available?)
- 4-chromatic projective graphs
- Algebraic characterization of uniquely vertex colorable graphs
- Bichromatic quadrangulations with Steiner points
- Coloring graphs with fixed genus and girth
- Conjectures on uniquely 3-edge-colorable graphs
- Cubic graphs with three Hamiltonian cycles are not always uniquely edge colorable
- Forcing structures and cliques in uniquely vertex colorable graphs
- Grötzsch's 3-color theorem and its counterparts for the torus and the projective plane
- Grötzsch's theorem on 3-colorings
- On small uniquely vertex-colourable graphs and Xu's conjecture
- On the coloring of signed graphs
- On uniquely 3-colorable graphs
- On uniquely 3-colorable planar graphs
- On uniquely \(3\)-colorable graphs. II
- On uniquely colorable planar graphs
- One counterexample for two conjectures on three coloring
- Onq-trees
- Quadrangulations on 3-colored point sets with Steiner points and their winding numbers
- Size of edge-critical uniquely 3-colorable planar graphs
- Some classes of uniquely 3-colorable graphs
- The size of edge-critical uniquely 3-colorable planar graphs
- The size of uniquely colorable graphs
- Uniquely colorable graphs
- Uniquely colorable graphs
- Uniquely edge-3-colorable graphs and snarks
- \(K_r\)-free uniquely vertex colorable graphs with minimum possible edges
- \(N\)-flips in even triangulations on surfaces
Cited in
(8)- Coloring Triangle-Free Graphs on Surfaces
- Three-coloring graphs embedded on surfaces with all faces even-sided
- On uniquely 3-colorable graphs
- Three-coloring triangle-free graphs on surfaces. III. Graphs of girth five
- scientific article; zbMATH DE number 7288622 (Why is no real title available?)
- Three-coloring triangle-free graphs on surfaces. V: Coloring planar graphs with distant anomalies
- A note on uniquely 3-colourable planar graphs
- Uniquely colorable graphs with equal chromatic and game chromatic numbers
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5206906)
