scientific article; zbMATH DE number 7145382
From MaRDI portal
Publication:5206906
zbMath1429.05075MaRDI QIDQ5206906
Publication date: 19 December 2019
Full work available at URL: http://ajc.maths.uq.edu.au/pdf/75/ajc_v75_p017.pdf
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items
Cites Work
- The size of edge-critical uniquely 3-colorable planar graphs
- Quadrangulations on 3-colored point sets with Steiner points and their winding numbers
- Size of edge-critical uniquely 3-colorable planar graphs
- On uniquely 3-colorable graphs
- Some classes of uniquely 3-colorable graphs
- One counterexample for two conjectures on three coloring
- On uniquely 3-colorable planar graphs
- Uniquely colorable graphs
- Grötzsch's 3-color theorem and its counterparts for the torus and the projective plane
- On uniquely \(3\)-colorable graphs. II
- Uniquely edge-3-colorable graphs and snarks
- On small uniquely vertex-colourable graphs and Xu's conjecture
- \(K_r\)-free uniquely vertex colorable graphs with minimum possible edges
- Bichromatic quadrangulations with Steiner points
- Algebraic characterization of uniquely vertex colorable graphs
- \(N\)-flips in even triangulations on surfaces
- On the coloring of signed graphs
- Grötzsch's theorem on 3-colorings
- The size of uniquely colorable graphs
- Forcing Structures and Cliques in Uniquely Vertex Colorable Graphs
- Onq-trees
- Cubic graphs with three Hamiltonian cycles are not always uniquely edge colorable
- Coloring graphs with fixed genus and girth
- 4-chromatic projective graphs
- Uniquely colorable graphs
- On uniquely colorable planar graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
