Conflict-free colourings of graphs and hypergraphs
From MaRDI portal
(Redirected from Publication:3552506)
Recommendations
Cites work
- A bound on the chromatic number of the square of a planar graph
- Colouring a graph frugally
- Conflict-free coloring of points and simple regions in the plane
- Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks
- New algorithmic aspects of the local lemma with applications to routing and partitioning
- On The Chromatic Number of Geometric Hypergraphs
- Online Conflict‐Free Coloring for Intervals
Cited in
(68)- Conflict-free connections of graphs
- On \(k\)-strong conflict-free multicoloring
- On conflict-free connection of graphs
- Graphs with conflict-free connection number two
- Conflict free colorings of (strongly) almost disjoint set-systems
- Conflict-free coloring of string graphs
- Conflict-free connection number and independence number of a graph
- Conflict-free connection of trees
- 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
- 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
- Conflict-free connection number of random graphs
- Hypergraph conflict analysis
- Non-monochromatic and conflict-free colorings on tree spaces and planar network spaces
- Essentially disjoint families, conflict free colorings and Shelah's revised GCH
- Brooks type results for conflict-free colorings and \(\{a, b \}\)-factors in graphs
- Unique-maximum and conflict-free coloring for hypergraphs and tree graphs
- Conflict-free colourings of uniform hypergraphs with few edges
- On conflict-free multi-coloring
- Exact and FPT algorithms for MAX-conflict free coloring in hypergraphs
- Theory and application of conflict resolution with hybrid preference in colored graphs
- Maximum value of conflict-free vertex-connection number of graphs
- Conflict-free coloring of graphs
- Conflict-free coloring of intersection graphs
- Infinite combinatorics plain and simple
- Complexity of conflict-free colorings of graphs
- Parameterized Complexity of Conflict-Free Graph Coloring
- On variants of conflict-free-coloring for hypergraphs
- A short note on open-neighborhood conflict-free colorings of graphs
- Conflict-free coloring of intersection graphs
- Conflict-free coloring and its applications
- The potential to improve the choice, list conflict-free coloring for geometric hypergraphs
- Conflict-free colouring of graphs
- Exact and Fixed Parameter Tractable Algorithms for Max-Conflict-Free Coloring in Hypergraphs
- 1-planar graphs are odd 13-colorable
- Single‐conflict colouring
- On conflict-free proper colourings of graphs without small degree vertices
- Conflict‐free chromatic number versus conflict‐free chromatic index
- Colouring a dominating set without conflicts: \(q\)-subset square colouring
- 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
- A note on the conflict-free chromatic index
- A survey on conflict-free connection coloring of graphs
- Conflict-free coloring: graphs of bounded clique-width and intersection graphs
- Exactly hittable interval graphs
- Conflict-free colouring of subsets
- Conflict free colorings of nonuniform systems of infinite sets
- Brooks-type theorems for relaxations of square colorings
- Proper conflict-free coloring of graphs with large maximum degree
- New bounds for odd colourings of graphs
- On asymptotically tight bound for the conflict-free chromatic index of nearly regular graphs
- Conflict-free chromatic index of trees
- Proper conflict-free coloring of Mycielskians with fast algorithms
- On the parameterized complexity of odd coloring
- Extremal results on conflict-free coloring
- Asymptotically optimal proper conflict-free coloring
- Complexity results for two kinds of conflict-free edge-coloring of graphs
- Perfect resolution of strong conflict-free colouring of interval hypergraphs
- Conflict-free coloring on subclasses of perfect graphs and bipartite graphs
- Streaming algorithms for conflict-free coloring
- On the parameterized complexity of odd coloring
- Selective hypergraph colourings
- Unique-maximum coloring of plane graphs
This page was built for publication: Conflict-free colourings of graphs and hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3552506)
