Pages that link to "Item:Q2486862"
From MaRDI portal
The following pages link to Conflict-free coloring of points and simple regions in the plane (Q2486862):
Displaying 43 items.
- Coloring planar homothets and three-dimensional hypergraphs (Q364847) (← links)
- Conflict-free coloring for rectangle ranges using \(O(n ^{.382})\) colors (Q443903) (← links)
- Coloring half-planes and bottomless rectangles (Q452449) (← links)
- Conflict-free coloring of points on a line with respect to a set of intervals (Q452451) (← links)
- Complexity of conflict-free colorings of graphs (Q484316) (← links)
- On variants of conflict-free-coloring for hypergraphs (Q507574) (← links)
- Graph unique-maximum and conflict-free colorings (Q635736) (← links)
- Coloring axis-parallel rectangles (Q986114) (← links)
- Dynamic conflict-free colorings in the plane (Q1631778) (← links)
- Coloring points with respect to squares (Q1688853) (← links)
- On conflict-free connection of graphs (Q1727736) (← links)
- Conflict-free coloring of string graphs (Q2022631) (← links)
- Conflict-free connection of trees (Q2051900) (← links)
- Non-monochromatic and conflict-free colorings on tree spaces and planar network spaces (Q2309464) (← links)
- Opposite-quadrant depth in the plane (Q2373438) (← links)
- A procedure for computing the symmetric difference of regions defined by polygonal curves (Q2437305) (← links)
- Brooks type results for conflict-free colorings and \(\{a, b \}\)-factors in graphs (Q2515567) (← links)
- Unique-Maximum and Conflict-Free Coloring for Hypergraphs and Tree Graphs (Q2891368) (← links)
- Conflict-Free Colourings of Uniform Hypergraphs With Few Edges (Q2908131) (← links)
- ON STRUCTURAL AND GRAPH THEORETIC PROPERTIES OF HIGHER ORDER DELAUNAY GRAPHS (Q3405973) (← links)
- Ordered Coloring Grids and Related Graphs (Q3408158) (← links)
- On Conflict-Free Multi-coloring (Q3449809) (← links)
- Conflict-Free Colourings of Graphs and Hypergraphs (Q3552506) (← links)
- Dynamic Offline Conflict-Free Coloring for Unit Disks (Q3602844) (← links)
- CONFLICT-FREE COLORINGS OF SHALLOW DISCS (Q3604140) (← links)
- Delaunay graphs of point sets in the plane with respect to axis‐parallel rectangles (Q3608310) (← links)
- Conflict-Free Coloring of Graphs (Q4556952) (← links)
- Conflict-Free Coloring of Intersection Graphs (Q4557736) (← links)
- Online Conflict-Free Colouring for Hypergraphs (Q4933597) (← links)
- Parameterized Complexity of Conflict-Free Graph Coloring (Q4959657) (← links)
- Improved Ramsey-type results for comparability graphs (Q4987258) (← links)
- Some results on strong conflict-free connection number of graphs (Q5025141) (← links)
- Convex partial transversals of planar regions (Q5091044) (← 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)
- (Q5136250) (← links)
- Fully-Dynamic and Kinetic Conflict-Free Coloring of Intervals with Respect to Points (Q5234040) (← links)
- Coloring Axis-Parallel Rectangles (Q5302752) (← links)
- Exact and Fixed Parameter Tractable Algorithms for Max-Conflict-Free Coloring in Hypergraphs (Q5745127) (← links)
- Coloring lines and Delaunay graphs with respect to boxes (Q6201036) (← links)
- A survey on conflict-free connection coloring of graphs (Q6497946) (← links)
- Exactly hittable interval graphs (Q6599815) (← links)
- On tangencies among planar curves with an application to coloring L-shapes (Q6612513) (← links)
