Facial rainbow coloring of plane graphs
From MaRDI portal
Publication:2312068
DOI10.7151/dmgt.2047zbMath1415.05052OpenAlexW2791522158MaRDI QIDQ2312068
Lucia Kekeňáková, Stanlislav Jendroľ
Publication date: 4 July 2019
Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.2047
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Cyclic colorings of plane graphs with independent faces
- Another step towards proving a conjecture by Plummer and Toft
- Cyclic coloring of plane graphs
- Every planar map is four colorable. I: Discharging
- Every planar map is four colorable. II: Reducibility
- On cyclic colorings and their generalizations
- The four-colour theorem
- Rainbow total-coloring of complementary graphs and Erdős-Gallai type problem for the rainbow total-connection number
- A new bound on the cyclic chromatic number
- Colorings of plane graphs: a survey
- Rainbow connections of graphs: a survey
- Ein Sechsfarbenproblem auf der Kugel
- Facially-constrained colorings of plane graphs: a survey
- Cyclic coloring of plane graphs with maximum face size 16 and 17
- Cyclic Chromatic Number of 3-Connected Plane Graphs
- Vertex rainbow colorings of graphs
- Non-rainbow colorings of 3-, 4- and 5-connected plane graphs
- 3-Facial Coloring of Plane Graphs
- A general upper bound for the cyclic chromatic number of 3‐connected plane graphs
- Cyclic coloration of 3-polytopes
- A new proof of the 6 color theorem
This page was built for publication: Facial rainbow coloring of plane graphs