Unique-maximum coloring of plane graphs

DOI10.7151/dmgt.1846zbMath1329.05106OpenAlexW2516177571MaRDI QIDQ907833

Frank Göring, Igor Fabrici

Publication date: 26 January 2016

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1846

zbMATH Keywords

plane graphunique-maximum coloringweak-parity coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items

Conflict-free connections of graphs, Facially-constrained colorings of plane graphs: a survey, Facial unique-maximum edge and total coloring of plane graphs, Colorings with neighborhood parity condition, Remarks on odd colorings of graphs, 1-planar graphs are odd 13-colorable, On facial unique-maximum (edge-)coloring, A counterexample to a conjecture on facial unique-maximal colorings, A survey on the cyclic coloring and its relaxations, Unnamed Item, Conflict-free connection number and independence number of a graph, Facial unique-maximum colorings of plane graphs with restriction on big vertices, Proper conflict-free and unique-maximum colorings of planar graphs with respect to neighborhoods, Remarks on proper conflict-free colorings of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graph unique-maximum and conflict-free colorings
• Coloring face-hypergraphs of graphs on surfaces
• Ordered colourings
• Unique-maximum edge-colouring of plane graphs with respect to faces
• Conflict-Free Colourings of Uniform Hypergraphs With Few Edges
• Conflict-Free Colourings of Graphs and Hypergraphs
• Colouring vertices of plane graphs under restrictions given by faces
• Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks
• Conflict-Free Coloring and its Applications
• Unique-Maximum and Conflict-Free Coloring for Hypergraphs and Tree Graphs
• Conflict-Free Colouring of Graphs