On the cyclic coloring conjecture
From MaRDI portal
Publication:2214053
DOI10.1016/j.disc.2020.112204zbMath1453.05035arXiv2009.10436OpenAlexW3097165450WikidataQ113877055 ScholiaQ113877055MaRDI QIDQ2214053
Roman Soták, Stanlislav Jendroľ
Publication date: 4 December 2020
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2009.10436
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
- Cyclic colorings of plane graphs with independent faces
- Contractions, cycle double covers, and cyclic colorings in locally connected graphs
- Another step towards proving a conjecture by Plummer and Toft
- Facial colorings using Hall's theorem
- Every planar map is four colorable. I: Discharging
- Every planar map is four colorable. II: Reducibility
- On cyclic colorings and their generalizations
- Cyclic, diagonal and facial colorings
- A new bound on the cyclic chromatic number
- Colorings of plane graphs: a survey
- A unified approach to distance-two colouring of graphs on surfaces
- Cyclic coloring of plane graphs with maximum face size 16 and 17
- Cyclic Chromatic Number of 3-Connected Plane Graphs
- Cyclic Colorings of 3-Polytopes with Large Maximum Face Size
- Third Case of the Cyclic Coloring Conjecture
- A note on cyclic chromatic number
- A new upper bound on the cyclic chromatic number
- 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
- A Theorem on Coloring the Lines of a Network
This page was built for publication: On the cyclic coloring conjecture
