Pages that link to "Item:Q4962749"
From MaRDI portal
The following pages link to Deterministic conflict-free coloring for intervals (Q4962749):
Displayed 20 items.
- Conflict-free coloring of points on a line with respect to a set of intervals (Q452451) (← links)
- Strong conflict-free coloring for intervals (Q487034) (← links)
- On variants of conflict-free-coloring for hypergraphs (Q507574) (← links)
- Graph unique-maximum and conflict-free colorings (Q635736) (← links)
- On conflict-free connection of graphs (Q1727736) (← links)
- Parameterized algorithms for conflict-free colorings of graphs (Q1786593) (← links)
- Conflict free colorings of (strongly) almost disjoint set-systems (Q1945294) (← links)
- Conflict-free connection of trees (Q2051900) (← links)
- Tight bounds for online coloring of basic graph classes (Q2223701) (← 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)
- Polynomial Time Algorithms for Bichromatic Problems (Q2971630) (← links)
- Ordered Coloring Grids and Related Graphs (Q3408158) (← links)
- On Conflict-Free Multi-coloring (Q3449809) (← links)
- Dynamic Offline Conflict-Free Coloring for Unit Disks (Q3602844) (← links)
- Online Conflict-Free Colouring for Hypergraphs (Q4933597) (← links)
- Tight Bounds for Online Coloring of Basic Graph Classes (Q5111690) (← links)
- Fully-Dynamic and Kinetic Conflict-Free Coloring of Intervals with Respect to Points. (Q5136245) (← links)
- Fully-Dynamic and Kinetic Conflict-Free Coloring of Intervals with Respect to Points (Q5234040) (← links)
- Online hypergraph coloring with rejection (Q5501518) (← links)