scientific article; zbMATH DE number 5506190

MaRDI QIDQ3601520zbMATH OpenFDO

Authors Noga Alon, Shakhar Smorodinsky

Publication date 10 February 2009

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cited in

(10)

• Structural parameterization for minimum conflict-free colouring
• Non-monochromatic and conflict-free colorings on tree spaces and planar network spaces
• On conflict-free multi-coloring
• Dynamic Offline Conflict-Free Coloring for Unit Disks
• Conflict-free coloring for rectangle ranges using \(O(n ^{.382})\) colors
• Conflict-free coloring of graphs
• Conflict-free coloring of intersection graphs
• A short note on open-neighborhood conflict-free colorings of graphs
• Conflict-free coloring of intersection graphs
• Conflict-free chromatic index of trees

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3601520)