Graph unique-maximum and conflict-free colorings

DOI10.1016/j.jda.2011.03.005zbMath1225.05093OpenAlexW2964222076MaRDI QIDQ635736

Géza Tóth, Panagiotis Cheilaris

Publication date: 23 August 2011

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2011.03.005

zbMATH Keywords

vertex rankinggrid graphconflict-free coloringordered coloringunique-maximum coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (21)

Unique-Maximum and Conflict-Free Coloring for Hypergraphs and Tree Graphs ⋮ Maximum value of conflict-free vertex-connection number of graphs ⋮ Conflict-Free Coloring of Graphs ⋮ Conflict-Free Coloring of Intersection Graphs ⋮ Conflict-free connections of graphs ⋮ Colorings with neighborhood parity condition ⋮ Conflict-free connection number of random graphs ⋮ On facial unique-maximum (edge-)coloring ⋮ Unique-maximum coloring of plane graphs ⋮ Maximum edge-colorings of graphs ⋮ On conflict-free connection of graphs ⋮ Maximizing and minimizing the number of generalized colorings of trees ⋮ Complexity of conflict-free colorings of graphs ⋮ Graphs with conflict-free connection number two ⋮ Exact and Fixed Parameter Tractable Algorithms for Max-Conflict-Free Coloring in Hypergraphs ⋮ Conflict-free connection number and independence number of a graph ⋮ Brooks type results for conflict-free colorings and \(\{a, b \}\)-factors in graphs ⋮ Conflict-free connection of trees ⋮ Proper conflict-free and unique-maximum colorings of planar graphs with respect to neighborhoods ⋮ Unique-maximum edge-colouring of plane graphs with respect to faces ⋮ Remarks on proper conflict-free colorings of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Optimal node ranking of trees
• Local optimization on graphs
• On neighbors in geometric permutations.
• Ordered colourings
• Conflict-free coloring of points and simple regions in the plane
• Ordered Coloring Grids and Related Graphs
• The Role of Elimination Trees in Sparse Factorization
• Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree
• Rankings of Graphs
• Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks
• Deterministic conflict-free coloring for intervals
• Online Conflict‐Free Coloring for Intervals
• Conflict-Free Colorings of Rectangles Ranges

This page was built for publication: Graph unique-maximum and conflict-free colorings