On facial unique-maximum (edge-)coloring
From MaRDI portal
Publication:1701086
DOI10.1016/j.dam.2017.11.024zbMath1380.05052arXiv1708.00094OpenAlexW2741858651MaRDI QIDQ1701086
Riste Škrekovski, Borut Lužar, Bernard Lidický, Vesna Andova
Publication date: 22 February 2018
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1708.00094
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items (3)
Facial unique-maximum edge and total coloring of plane graphs ⋮ A survey on the cyclic coloring and its relaxations ⋮ Facial unique-maximum colorings of plane graphs with restriction on big vertices
Cites Work
- Graph unique-maximum and conflict-free colorings
- Unique-maximum coloring of plane graphs
- Every planar graph is 5-choosable
- Ordered colourings
- Unique-maximum edge-colouring of plane graphs with respect to faces
- Facially-constrained colorings of plane graphs: a survey
- Coloring of Plane Graphs with Unique Maximal Colors on Faces
- 4-chromatic projective graphs
- Unique-Maximum and Conflict-Free Coloring for Hypergraphs and Tree Graphs
This page was built for publication: On facial unique-maximum (edge-)coloring