Pages that link to "Item:Q5258999"
From MaRDI portal
The following pages link to Conflict-Free Coloring and its Applications (Q5258999):
Displaying 38 items.
- Conflict-free coloring for rectangle ranges using \(O(n ^{.382})\) colors (Q443903) (← links)
- Strong conflict-free coloring for intervals (Q487034) (← links)
- Selective hypergraph colourings (Q906467) (← links)
- Unique-maximum coloring of plane graphs (Q907833) (← links)
- Dynamic conflict-free colorings in the plane (Q1631778) (← links)
- Coloring points with respect to squares (Q1688853) (← links)
- Maximizing and minimizing the number of generalized colorings of trees (Q1727776) (← links)
- Conflict-free coloring of string graphs (Q2022631) (← links)
- Conflict-free connection of trees (Q2051900) (← links)
- Proper conflict-free and unique-maximum colorings of planar graphs with respect to neighborhoods (Q2097169) (← links)
- Remarks on proper conflict-free colorings of graphs (Q2099465) (← links)
- Conflict-free coloring: graphs of bounded clique width and intersection graphs (Q2115843) (← links)
- Conflict-free coloring bounds on open neighborhoods (Q2161000) (← links)
- A tight bound for conflict-free coloring in terms of distance to cluster (Q2166302) (← links)
- Colorings with neighborhood parity condition (Q2172422) (← links)
- Conflict-free coloring of intersection graphs of geometric objects (Q2207603) (← links)
- Coloring intersection hypergraphs of pseudo-disks (Q2207604) (← links)
- (Strong) conflict-free connectivity: algorithm and complexity (Q2283032) (← links)
- Reverse mathematics and colorings of hypergraphs (Q2312088) (← links)
- Conflict-free chromatic art gallery coverage (Q2441589) (← links)
- Brooks type results for conflict-free colorings and \(\{a, b \}\)-factors in graphs (Q2515567) (← links)
- On Conflict-Free Multi-coloring (Q3449809) (← links)
- Parameterized Complexity of Conflict-Free Graph Coloring (Q4959657) (← links)
- Some results on strong conflict-free connection number of graphs (Q5025141) (← links)
- Coloring intersection hypergraphs of pseudo-disks (Q5115820) (← links)
- Fully-Dynamic and Kinetic Conflict-Free Coloring of Intervals with Respect to Points. (Q5136245) (← links)
- Dynamic Conflict-Free Colorings in the Plane (Q5136246) (← links)
- Coloring Hypergraphs Defined by Stabbed Pseudo-Disks and ABAB-Free Hypergraphs (Q5138972) (← links)
- Fully-Dynamic and Kinetic Conflict-Free Coloring of Intervals with Respect to Points (Q5234040) (← links)
- Exact and Fixed Parameter Tractable Algorithms for Max-Conflict-Free Coloring in Hypergraphs (Q5745127) (← links)
- On conflict-free proper colourings of graphs without small degree vertices (Q6056427) (← links)
- Conflict‐free chromatic number versus conflict‐free chromatic index (Q6057644) (← links)
- On odd colorings of planar graphs (Q6080172) (← links)
- A short note on conflict‐free coloring on closed neighborhoods of bounded degree graphs (Q6080863) (← links)
- The odd chromatic number of a toroidal graph is at most 9 (Q6161443) (← links)
- A note on the conflict-free chromatic index (Q6197755) (← links)
- Coloring lines and Delaunay graphs with respect to boxes (Q6201036) (← links)
- A survey on conflict-free connection coloring of graphs (Q6497946) (← links)
