Unique-Maximum and Conflict-Free Coloring for Hypergraphs and Tree Graphs

DOI10.1007/978-3-642-27660-6_16zbMath1298.05108arXiv1002.4210OpenAlexW1594314465MaRDI QIDQ2891368

Panagiotis Cheilaris, Balázs Keszegh, Dömötör Pálvölgyi

Publication date: 15 June 2012

Published in: SOFSEM 2012: Theory and Practice of Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1002.4210

Mathematics Subject Classification ID

Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15)

Related Items (1)

Brooks type results for conflict-free colorings and \(\{a, b \}\)-factors in graphs

Cites Work

• Unnamed Item
• Graph unique-maximum and conflict-free colorings
• Optimal node ranking of trees
• Local optimization on graphs
• Ordered colourings
• Conflict-free coloring of points and simple regions in the plane
• Tree-depth, subgraph coloring and homomorphism bounds
• The Role of Elimination Trees in Sparse Factorization
• Conflict-Free Colourings of Graphs and Hypergraphs
• 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: Unique-Maximum and Conflict-Free Coloring for Hypergraphs and Tree Graphs