Facially-constrained colorings of plane graphs: a survey
From MaRDI portal
Publication:2401805
DOI10.1016/j.disc.2016.07.026zbMath1369.05071OpenAlexW2516873386MaRDI QIDQ2401805
Július Czap, Stanlislav Jendroľ
Publication date: 5 September 2017
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2016.07.026
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items
Graph polynomials and paintability of plane graphs ⋮ Zig-zag facial total-coloring of plane graphs ⋮ Facial anagram-free edge-coloring of plane graphs ⋮ Embeddings of a graph into a surface with different weak chromatic numbers ⋮ Facial unique-maximum edge and total coloring of plane graphs ⋮ Facial \(L(2, 1)\)-edge-labelings of trees ⋮ Facial rainbow edge-coloring of plane graphs ⋮ Edge-coloring of plane multigraphs with many colors on facial cycles ⋮ Facial \([r,s,t\)-colorings of plane graphs] ⋮ On the edge-connectivity and restricted edge-connectivity of optimal 1-planar graphs ⋮ Loose edge-connection of graphs ⋮ On facial unique-maximum (edge-)coloring ⋮ A counterexample to a conjecture on facial unique-maximal colorings ⋮ Unnamed Item ⋮ Facial packing vertex-coloring of subdivided plane graphs ⋮ Facial rainbow edge-coloring of simple 3-connected plane graphs ⋮ Facial achromatic number of triangulations on the sphere ⋮ Odd connection and odd vertex-connection of graphs ⋮ Proper colorings of plane quadrangulations without rainbow faces ⋮ Facial visibility in edge colored plane graphs ⋮ Facial rainbow coloring of plane graphs ⋮ Improved bounds for some facially constrained colorings
Cites Work
- Every planar map is four colorable
- Colouring the Edges of a Multigraph so that Each Vertex has at Most j , or at Least j , Edges of Each Colour on it
- On-line ranking number for cycles and paths
- Nonrepetitive colorings of graphs
- A new proof of the 6 color theorem
- Structural properties of plane graphs without adjacent triangles and an application to 3-colorings
- A Graph-Coloring Result and Its Consequences for Polygon-Guarding Problems
- Facial parity edge coloring of outerplane graphs
- New approach to nonrepetitive sequences
- Chromatic-index critical multigraphs of order 20
- Matchings and Nonrainbow Colorings
- Covering the edges of a graph by three odd subgraphs
- A Theorem on Coloring the Lines of a Network
- Polychromatic colorings of plane graphs
- Gaps in the chromatic spectrum of face-constrained plane graphs
- Every planar graph with maximum degree 7 is of class 1
- On planar mixed hypergraphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the facial Thue choice number of plane graphs via entropy compression method
- Facial packing edge-coloring of plane graphs
- Improved bound on facial parity edge coloring
- Parity vertex coloring of outerplane graphs
- Polychromatic 4-coloring of cubic bipartite plane graphs
- On the facial Thue choice index of plane graphs
- Facial parity edge colouring of plane pseudographs
- An improved bound on parity vertex colourings of outerplane graphs
- \(\ell\)-facial edge colorings of graphs
- Facial edge ranking of plane graphs
- Facial parity 9-edge-coloring of outerplane graphs
- Nonrepetitive colouring via entropy compression
- Parity vertex colouring of plane graphs
- List 2-facial 5-colorability of plane graphs with girth at least 12
- Nonrepetitive vertex colorings of graphs
- Looseness of plane graphs
- Cyclic colorings of plane graphs with independent faces
- Guarding polyhedral terrains
- List colourings of planar graphs
- \(K_3\)-WORM colorings of graphs: lower chromatic number and gaps in the chromatic spectrum
- A note on 2-facial coloring of plane graphs
- Rainbowness of cubic plane graphs
- Colorings of planar graphs with no rainbow faces
- Nonrepetitive colorings of trees
- Unique-maximum coloring of plane graphs
- Maximum edge-colorings of graphs
- Nonrepetitive colorings of graphs -- a survey
- Nonrepetitive colorings of graphs of bounded tree-width
- Another step towards proving a conjecture by Plummer and Toft
- Facial colorings using Hall's theorem
- On 3-colorability of planar graphs without adjacent short cycles
- Polychromatic 4-coloring of guillotine subdivisions
- A note on the edge cover chromatic index of multigraphs
- On 3-colorable planar graphs without short cycles
- Choosability of the square of planar subcubic graphs with large girth
- Planar graphs without 5- and 7-cycles and without adjacent triangles are 3-colorable
- Polychromatic colorings of rectangular partitions
- Polychromatic colorings of arbitrary rectangular partitions
- Planar graphs without adjacent cycles of length at most seven are 3-colorable
- Cyclic coloring of plane graphs
- Every planar map is four colorable. I: Discharging
- Every planar map is four colorable. II: Reducibility
- The Grötzsch theorem for the hypergraph of maximal cliques
- On cyclic colorings and their generalizations
- Every planar graph is 5-choosable
- Grötzsch's 3-color theorem and its counterparts for the torus and the projective plane
- The four-colour theorem
- Worst-case-optimal algorithms for guarding planar graphs and polyhedral surfaces
- Maximum face-constrained coloring of plane graphs
- On maximum face-constrained coloring of plane graphs with no short face cycles.
- Colouring planar mixed hypergraphs
- Cyclic, diagonal and facial colorings
- Planar graphs without cycles of length from 4 to 7 are 3-colorable
- A note on the three color problem
- A new bound on the cyclic chromatic number
- Planar graphs of maximum degree seven are Class I
- There are ternary circular square-free words of length \(n\) for \(n \geq\) 18
- A not 3-choosable planar graph without 3-cycles
- Colorings of plane graphs: a survey
- Unique-maximum edge-colouring of plane graphs with respect to faces
- Cyclic, diagonal and facial colorings -- a missing case
- Ein Sechsfarbenproblem auf der Kugel
- Worm colorings
- Looseness ranges of triangulations on closed surfaces
- Grötzsch's theorem on 3-colorings
- Facial list colourings of plane graphs
- A 3-color theorem on plane graphs without 5-circuits
- Cyclic Chromatic Number of 3-Connected Plane Graphs
- Third Case of the Cyclic Coloring Conjecture
- Coloring of Plane Graphs with Unique Maximal Colors on Faces
- Facial Nonrepetitive Vertex Coloring of Plane Graphs
- Decompositions of plane graphs under parity constrains given by faces
- On the Facial Thue Choice Index via Entropy Compression
- A note on cyclic chromatic number
- Planar graphs with neither 5-cycles nor close 3-cycles are 3-colorable
- Facial non-repetitive edge-coloring of plane graphs
- Nonrepetitive list colourings of paths
- On the strong parity chromatic number
- Facial parity edge colouring
- GUARDING RECTANGULAR PARTITIONS
- Odd edge coloring of graphs
- Edge looseness of plane graphs
- On square-free vertex colorings of graphs
- Non-rainbow colorings of 3-, 4- and 5-connected plane graphs
- Colouring vertices of plane graphs under restrictions given by faces
- 3-Facial Coloring of Plane Graphs
- On rainbowness of semiregular polyhedra
- Polychromatic colorings of bounded degree plane graphs
- A general upper bound for the cyclic chromatic number of 3‐connected plane graphs
- Rainbow faces in edge‐colored plane graphs
- Cyclic coloration of 3-polytopes
- On decompositions of a multi-graph into spanning subgraphs
