Graph unique-maximum and conflict-free colorings
type: Item
instance of: scholarly article
title: Graph unique-maximum and conflict-free colorings
zbMATH Open document ID: 1225.05093
author: Panagiotis Cheilaris
author: Géza Tóth
published in: Journal of Discrete Algorithms
publication date: 2011-08-23T00:00:00Z
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 5941897
zbMATH Keywords: conflict-free coloring
zbMATH Keywords: unique-maximum coloring
zbMATH Keywords: grid graph
zbMATH Keywords: ordered coloring
zbMATH Keywords: vertex ranking
MaRDI profile type: Publication
full work available at URL: j.jda.2011.03.005
OpenAlex ID: W2964222076
cites work: Ordered Coloring Grids and Related Graphs
cites work: Deterministic conflict-free coloring for intervals
cites work: Rankings of Graphs
cites work: Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree
cites work: Online Conflict‐Free Coloring for Intervals
cites work: Conflict-Free Colorings of Rectangles Ranges
cites work: Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks
cites work: Conflict-free coloring of points and simple regions in the plane
cites work: Optimal node ranking of trees
cites work: Ordered colourings
cites work: The Role of Elimination Trees in Sparse Factorization
cites work: Local optimization on graphs
cites work: Q5692720
cites work: Q4298260
cites work: On neighbors in geometric permutations.
DOI: 10.1016/J.JDA.2011.03.005
description: scientific article; zbMATH DE number 5941897