Conflict-Free Colourings of Graphs and Hypergraphs
From MaRDI portal
Publication:3552506
DOI10.1017/S0963548309990290zbMath1197.05054MaRDI QIDQ3552506
Publication date: 22 April 2010
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Related Items (41)
Unique-Maximum and Conflict-Free Coloring for Hypergraphs and Tree Graphs ⋮ On Conflict-Free Multi-coloring ⋮ Conflict-Free Colourings of Uniform Hypergraphs With Few Edges ⋮ Maximum value of conflict-free vertex-connection number of graphs ⋮ Conflict-Free Coloring of Graphs ⋮ Conflict-Free Coloring of Intersection Graphs ⋮ Conflict-free connections of graphs ⋮ Conflict-free coloring bounds on open neighborhoods ⋮ Structural parameterization for minimum conflict-free colouring ⋮ A tight bound for conflict-free coloring in terms of distance to cluster ⋮ Colorings with neighborhood parity condition ⋮ 1-planar graphs are odd 13-colorable ⋮ On conflict-free proper colourings of graphs without small degree vertices ⋮ Conflict‐free chromatic number versus conflict‐free chromatic index ⋮ Proper conflict-free list-coloring, odd minors, subdivisions, and layered treewidth ⋮ On odd colorings of planar graphs ⋮ A short note on conflict‐free coloring on closed neighborhoods of bounded degree graphs ⋮ Conflict-free connection number of random graphs ⋮ Conflict free colorings of (strongly) almost disjoint set-systems ⋮ A note on the conflict-free chromatic index ⋮ Selective hypergraph colourings ⋮ Unique-maximum coloring of plane graphs ⋮ Conflict-free coloring of intersection graphs of geometric objects ⋮ A Short Note on Open-Neighborhood Conflict-Free Colorings of Graphs ⋮ On conflict-free connection of graphs ⋮ Complexity of conflict-free colorings of graphs ⋮ On variants of conflict-free-coloring for hypergraphs ⋮ Graphs with conflict-free connection number two ⋮ Conflict-Free Colouring of Graphs ⋮ Exact and Fixed Parameter Tractable Algorithms for Max-Conflict-Free Coloring in Hypergraphs ⋮ Conflict-free coloring of string graphs ⋮ Conflict-free connection number and independence number of a graph ⋮ INFINITE COMBINATORICS PLAIN AND SIMPLE ⋮ 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 ⋮ Non-monochromatic and conflict-free colorings on tree spaces and planar network spaces ⋮ Unnamed Item ⋮ Proper conflict-free and unique-maximum colorings of planar graphs with respect to neighborhoods ⋮ Remarks on proper conflict-free colorings of graphs ⋮ Conflict-free coloring: graphs of bounded clique width and intersection graphs
Cites Work
- Colouring a graph frugally
- A bound on the chromatic number of the square of a planar graph
- Conflict-free coloring of points and simple regions in the plane
- New Algorithmic Aspects of the Local Lemma with Applications to Routing and Partitioning
- On The Chromatic Number of Geometric Hypergraphs
- Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks
- Online Conflict‐Free Coloring for Intervals
This page was built for publication: Conflict-Free Colourings of Graphs and Hypergraphs
