Combinatorial bounds for conflict-free coloring on open neighborhoods

DOI10.1007/978-3-030-60440-0_1OpenAlexW3095834157MaRDI QIDQ2110602

Sriram Bhyravarapu, Subrahmanyam Kalyanasundaram

Publication date: 21 December 2022

Full work available at URL: https://arxiv.org/abs/2007.05585

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (5)

Conflict-free coloring bounds on open neighborhoods ⋮ A tight bound for conflict-free coloring in terms of distance to cluster ⋮ Odd coloring of sparse graphs and planar graphs ⋮ Proper conflict-free and unique-maximum colorings of planar graphs with respect to neighborhoods ⋮ Conflict-free coloring: graphs of bounded clique width and intersection graphs

This page was built for publication: Combinatorial bounds for conflict-free coloring on open neighborhoods