On conflict-free multi-coloring
From MaRDI portal
Publication:3449809
DOI10.1007/978-3-319-21840-3_9zbMATH Open1444.05054OpenAlexW1161344964MaRDI QIDQ3449809FDOQ3449809
Fabrizio Grandoni, Andreas Bärtschi
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
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
Graph algorithms (graph-theoretic aspects) (05C85) Coloring of graphs and hypergraphs (05C15) Hypergraphs (05C65)
Cites Work
- On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
- Probability and Computing
- Title not available (Why is that?)
- Asymptotic lower bounds for Ramsey functions
- A constructive proof of the general lovász local lemma
- 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
- Models and solution techniques for frequency assignment problems
- Conflict-Free Colourings of Graphs and Hypergraphs
- Conflict-Free Coloring and its Applications
- Conflict-free coloring of points and simple regions in the plane
- On The Chromatic Number of Geometric Hypergraphs
- On a problem of Spencer
- Title not available (Why is that?)
- Conflict-free coloring of points on a line with respect to a set of intervals
- Strong Conflict-Free Coloring for Intervals
- Coloring axis-parallel rectangles
- Online Conflict-Free Colouring for Hypergraphs
- Conflict-free colourings of uniform hypergraphs with few edges
- Conflict-free chromatic art gallery coverage
- Improved bounds for the conflict-free chromatic art gallery problem
Cited In (8)
- Fully-Dynamic and Kinetic Conflict-Free Coloring of Intervals with Respect to Points.
- 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
- Online Conflict-Free Colorings for Hypergraphs
- Low-weight superimposed codes and related combinatorial structures: bounds and applications
- Conflict-free coloring of unit disks
- Non-monochromatic and conflict-free colorings on tree spaces and planar network spaces
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)
