A survey on the cyclic coloring and its relaxations
From MaRDI portal
Publication:2214302
DOI10.7151/dmgt.2369zbMath1454.05036OpenAlexW3097065863MaRDI QIDQ2214302
Július Czap, Mirko Horňák, Stanlislav Jendroľ
Publication date: 8 December 2020
Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.2369
Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Graph representations (geometric and intersection representations, etc.) (05C62) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items
Cites Work
- Edge coloring of planar graphs which any two short cycles are adjacent at most once
- Improved bound on facial parity edge coloring
- Edge colorings of planar graphs without 5-cycles with two chords
- Parity vertex coloring of outerplane graphs
- Facial parity edge colouring of plane pseudographs
- An improved bound on parity vertex colourings of outerplane graphs
- Planar graphs of maximum degree six without 7-cycles are class one
- \(\ell\)-facial edge colorings of graphs
- Facial parity 9-edge-coloring of outerplane graphs
- Parity vertex colouring of plane graphs
- List 2-facial 5-colorability of plane graphs with girth at least 12
- Cyclic colorings of plane graphs with independent faces
- A note on 2-facial coloring of plane graphs
- Contractions, cycle double covers, and cyclic colorings in locally connected graphs
- Unique-maximum coloring of plane graphs
- Another step towards proving a conjecture by Plummer and Toft
- Facial colorings using Hall's theorem
- 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
- Edge coloring of planar graphs without adjacent 7-cycles
- The square of a planar cubic graph is 7-colorable
- On facial unique-maximum (edge-)coloring
- A counterexample to a conjecture on facial unique-maximal colorings
- Edge colorings of planar graphs without 6-cycles with three chords
- A sufficient condition for a plane graph with maximum degree 6 to be class 1
- Cyclic, diagonal and facial colorings
- A new bound on the cyclic chromatic number
- Planar graphs of maximum degree seven are Class I
- A note on graphs of class I
- On vertex types and cyclic colourings of 3-connected plane graphs
- Improved bounds for some facially constrained colorings
- On the cyclic coloring conjecture
- Facial rainbow coloring of plane graphs
- Facial unique-maximum colorings of plane graphs with restriction on big vertices
- Unique-maximum edge-colouring of plane graphs with respect to faces
- Cyclic, diagonal and facial colorings -- a missing case
- Facial rainbow edge-coloring of plane graphs
- A unified approach to distance-two colouring of graphs on surfaces
- A sufficient condition for a planar graph to be class I
- Some sufficient conditions for a planar graph of maximum degree six to be Class 1
- 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
- Coloring of Plane Graphs with Unique Maximal Colors on Faces
- Decompositions of plane graphs under parity constrains given by faces
- A note on cyclic chromatic number
- On the strong parity chromatic number
- Facial parity edge colouring
- Facial rainbow edge-coloring of simple 3-connected plane graphs
- A new upper bound on the cyclic chromatic number
- Colouring vertices of plane graphs under restrictions given by faces
- List-Coloring Squares of Sparse Subcubic 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
- Every planar map is four colorable
- Unavoidable set of face types for planar maps
- Cyclic degree and cyclic coloring of 3-polytopes
- A new proof of the 6 color theorem
- Facial parity edge coloring of outerplane graphs
- A Theorem on Coloring the Lines of a Network
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
