On conflict-free multi-coloring

DOI10.1007/978-3-319-21840-3_9MaRDI QIDQ3449809zbMATH OpenOpenAlexFDO

Authors Andreas Bärtschi, Fabrizio Grandoni

Publication date 30 October 2015

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-21840-3_9

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Coloring of graphs and hypergraphs (05C15) Hypergraphs (05C65)

Recommendations

• Conflict-free colourings of graphs and hypergraphs
• On \(k\)-strong conflict-free multicoloring
• Conflict-free colourings of uniform hypergraphs with few edges
• Exact and FPT algorithms for MAX-conflict free coloring in hypergraphs
• Exact and Fixed Parameter Tractable Algorithms for Max-Conflict-Free Coloring in Hypergraphs

Cites work

• scientific article; zbMATH DE number 5506190 (Why is no real title available?)
• scientific article; zbMATH DE number 3492718 (Why is no real title available?)
• A constructive proof of the general Lovász local lemma
• Asymptotic lower bounds for Ramsey functions
• Coloring axis-parallel rectangles
• Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks
• Conflict-free chromatic art gallery coverage
• Conflict-free coloring and its applications
• Conflict-free coloring of points and simple regions in the plane
• Conflict-free coloring of points on a line with respect to a set of intervals
• Conflict-free colourings of graphs and hypergraphs
• Conflict-free colourings of uniform hypergraphs with few edges
• Deterministic conflict-free coloring for intervals: from offline to online
• Improved bounds for the conflict-free chromatic art gallery problem
• Models and solution techniques for frequency assignment problems
• On The Chromatic Number of Geometric Hypergraphs
• On a problem of Spencer
• On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
• Online Conflict‐Free Coloring for Intervals
• Online conflict-free colouring for hypergraphs
• Probability and Computing
• Strong conflict-free coloring for intervals

Cited in

(15)

• Conflict-free colourings of graphs and hypergraphs
• Conflict-free coloring and its applications
• Conflict-free colourings of uniform hypergraphs with few edges
• Fully-Dynamic and Kinetic Conflict-Free Coloring of Intervals with Respect to Points
• On conflict-free coloring of points and simple regions in the plane
• Colouring a dominating set without conflicts: \(q\)-subset square colouring
• Exact and FPT algorithms for MAX-conflict free coloring in hypergraphs
• Online Conflict-Free Colorings for Hypergraphs
• Low-weight superimposed codes and related combinatorial structures: bounds and applications
• On variants of conflict-free-coloring for hypergraphs
• Conflict-free coloring of unit disks
• Fully-dynamic and kinetic conflict-free coloring of intervals with respect to points
• The potential to improve the choice, list conflict-free coloring for geometric hypergraphs
• Non-monochromatic and conflict-free colorings on tree spaces and planar network spaces
• On \(k\)-strong conflict-free multicoloring

This page was built for publication: On conflict-free multi-coloring

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3449809)