Recommendations
Cites work
- scientific article; zbMATH DE number 4043860 (Why is no real title available?)
- 25 pretty graph colouring problems
- A bound on the chromatic number of the square of a planar graph
- Coloring the square of a \(K_{4}\)-minor free graph
- Cyclic, diagonal and facial colorings
- On the \(d\)-distance face chromatic number of plane graphs
Cited in
(15)- 2-facial 4-coloring of planar graphs with girth at least 22
- A note on face coloring entire weightings of plane graphs
- Facially-constrained colorings of plane graphs: a survey
- Wegner's conjecture on 2-distance coloring
- Colorings of plane graphs without long monochromatic facial paths
- Face 2-Colorable Embeddings with Faces of Specified Lengths
- 3-Facial Coloring of Plane Graphs
- Minimum 2-distance coloring of planar graphs and channel assignment
- List 2-facial 5-colorability of plane graphs with girth at least 12
- Injective colorings of planar graphs with few colors
- Facial graceful coloring of plane graphs
- Wegner's conjecture on 2-distance coloring for planar graphs
- A survey on the cyclic coloring and its relaxations
- A Frameless 2-Coloring of the Plane Lattice
- \(\ell\)-facial edge colorings of graphs
This page was built for publication: A note on 2-facial coloring of plane graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q844207)