scientific article; zbMATH DE number 7145382
From MaRDI portal
Publication:5206906
zbMATH Open1429.05075MaRDI QIDQ5206906FDOQ5206906
Authors: Naoki Matsumoto
Publication date: 19 December 2019
Full work available at URL: http://ajc.maths.uq.edu.au/pdf/75/ajc_v75_p017.pdf
Title of this publication is not available (Why is that?)
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
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Forcing structures and cliques in uniquely vertex colorable graphs
- Onq-trees
- Title not available (Why is that?)
- Title not available (Why is that?)
- Uniquely edge-3-colorable graphs and snarks
- On the coloring of signed graphs
- Title not available (Why is that?)
- Cubic graphs with three Hamiltonian cycles are not always uniquely edge colorable
- Grötzsch's 3-color theorem and its counterparts for the torus and the projective plane
- Grötzsch's theorem on 3-colorings
- Coloring graphs with fixed genus and girth
- 4-chromatic projective graphs
- Uniquely colorable graphs
- On uniquely 3-colorable graphs
- One counterexample for two conjectures on three coloring
- On uniquely 3-colorable planar graphs
- On uniquely \(3\)-colorable graphs. II
- The size of uniquely colorable graphs
- The size of edge-critical uniquely 3-colorable planar graphs
- Title not available (Why is that?)
- On uniquely colorable planar graphs
- Size of edge-critical uniquely 3-colorable planar graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- \(N\)-flips in even triangulations on surfaces
- \(K_r\)-free uniquely vertex colorable graphs with minimum possible edges
- Algebraic characterization of uniquely vertex colorable graphs
- Bichromatic quadrangulations with Steiner points
- Quadrangulations on 3-colored point sets with Steiner points and their winding numbers
- Uniquely colorable graphs
- Some classes of uniquely 3-colorable graphs
- Title not available (Why is that?)
- On small uniquely vertex-colourable graphs and Xu's conjecture
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (7)
- 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
- Title not available (Why is that?)
- Three-coloring triangle-free graphs on surfaces. V: Coloring planar graphs with distant anomalies
- 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)