Pages that link to "Item:Q5422489"

The following pages link to Online Conflict‐Free Coloring for Intervals (Q5422489):

Displaying 33 items.

• Asymmetric coloring games on incomparability graphs (Q324375) (← links)
• Conflict-free coloring of points on a line with respect to a set of intervals (Q452451) (← links)
• On variants of conflict-free-coloring for hypergraphs (Q507574) (← links)
• Graph unique-maximum and conflict-free colorings (Q635736) (← links)
• Dynamic conflict-free colorings in the plane (Q1631778) (← links)
• On conflict-free connection of graphs (Q1727736) (← links)
• Conflict-free coloring of string graphs (Q2022631) (← links)
• Conflict-free connection of trees (Q2051900) (← links)
• Conflict-free coloring bounds on open neighborhoods (Q2161000) (← links)
• A note about online nonrepetitive coloring \(k\)-trees (Q2197409) (← links)
• Conflict-free coloring of intersection graphs of geometric objects (Q2207603) (← links)
• Non-monochromatic and conflict-free colorings on tree spaces and planar network spaces (Q2309464) (← links)
• Online coloring co-interval graphs (Q2380735) (← 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)
• Online conflict-free coloring for intervals (Q2921711) (← links)
• Polynomial Time Algorithms for Bichromatic Problems (Q2971630) (← 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)
• Dynamic Conflict-Free Colorings in the Plane (Q5136246) (← links)
• Online hypergraph coloring with rejection (Q5501518) (← links)
• Variable Sized Online Interval Coloring with Bandwidth (Q5757892) (← links)
• (Q6084415) (← links)
• A survey on conflict-free connection coloring of graphs (Q6497946) (← links)
• Exactly hittable interval graphs (Q6599815) (← links)
• Online class cover problem (Q6600810) (← links)