Conflict-Free Coloring and its Applications
From MaRDI portal
Publication:5258999
DOI10.1007/978-3-642-41498-5_12zbMath1314.05081arXiv1005.3616OpenAlexW1826123464MaRDI QIDQ5258999
Publication date: 24 June 2015
Published in: Bolyai Society Mathematical Studies (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1005.3616
Related Items (37)
Dynamic conflict-free colorings in the plane ⋮ On Conflict-Free Multi-coloring ⋮ Conflict-free coloring bounds on open neighborhoods ⋮ A tight bound for conflict-free coloring in terms of distance to cluster ⋮ Colorings with neighborhood parity condition ⋮ On conflict-free proper colourings of graphs without small degree vertices ⋮ Conflict‐free chromatic number versus conflict‐free chromatic index ⋮ Coloring points with respect to squares ⋮ On odd colorings of planar graphs ⋮ A short note on conflict‐free coloring on closed neighborhoods of bounded degree graphs ⋮ The odd chromatic number of a toroidal graph is at most 9 ⋮ A note on the conflict-free chromatic index ⋮ Coloring lines and Delaunay graphs with respect to boxes ⋮ Selective hypergraph colourings ⋮ Unique-maximum coloring of plane graphs ⋮ Conflict-free coloring of intersection graphs of geometric objects ⋮ Coloring intersection hypergraphs of pseudo-disks ⋮ Conflict-free coloring for rectangle ranges using \(O(n ^{.382})\) colors ⋮ Conflict-free chromatic art gallery coverage ⋮ Coloring Hypergraphs Defined by Stabbed Pseudo-Disks and ABAB-Free Hypergraphs ⋮ Maximizing and minimizing the number of generalized colorings of trees ⋮ Strong conflict-free coloring for intervals ⋮ Exact and Fixed Parameter Tractable Algorithms for Max-Conflict-Free Coloring in Hypergraphs ⋮ Conflict-free coloring of string graphs ⋮ (Strong) conflict-free connectivity: algorithm and complexity ⋮ Brooks type results for conflict-free colorings and \(\{a, b \}\)-factors in graphs ⋮ Parameterized Complexity of Conflict-Free Graph Coloring ⋮ Conflict-free connection of trees ⋮ Reverse mathematics and colorings of hypergraphs ⋮ Fully-Dynamic and Kinetic Conflict-Free Coloring of Intervals with Respect to Points ⋮ Proper conflict-free and unique-maximum colorings of planar graphs with respect to neighborhoods ⋮ Remarks on proper conflict-free colorings of graphs ⋮ Fully-Dynamic and Kinetic Conflict-Free Coloring of Intervals with Respect to Points. ⋮ Dynamic Conflict-Free Colorings in the Plane ⋮ Some results on strong conflict-free connection number of graphs ⋮ Coloring intersection hypergraphs of pseudo-disks ⋮ Conflict-free coloring: graphs of bounded clique width and intersection graphs
This page was built for publication: Conflict-Free Coloring and its Applications
