Conflict-free coloring bounds on open neighborhoods
type: Item
instance of: scholarly article
title: Conflict-free coloring bounds on open neighborhoods
author: Sriram Bhyravarapu
author: Subrahmanyam Kalyanasundaram
author: Rogers Mathew
published in: Algorithmica
publication date: 2022-08-03T00:00:00Z
Mathematics Subject Classification ID: 68Wxx
Mathematics Subject Classification ID: 05Cxx
zbMATH DE Number: 7567458
MaRDI profile type: MaRDI publication profile
full work available at URL: s00453-022-00956-6
OpenAlex ID: W4281492744
cites work: Combinatorial bounds for conflict-free coloring on open neighborhoods
cites work: Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks
cites work: Conflict-free coloring and its applications
cites work: Conflict-free coloring of graphs
cites work: Complexity of conflict-free colorings of graphs
cites work: Parameterized algorithms for conflict-free colorings of graphs
cites work: Parameterized complexity of conflict-free graph coloring
cites work: Conflict-free coloring of intersection graphs
cites work: Online Conflict‐Free Coloring for Intervals
cites work: Conflict-free colourings of graphs and hypergraphs
cites work: A short note on open-neighborhood conflict-free colorings of graphs
cites work: Parameterized algorithms
cites work: Deterministic algorithms for the Lovász local lemma
cites work: Conflict‐free chromatic number versus conflict‐free chromatic index
cites work: The four-colour theorem
cites work: Q5315023
cites work: Free choosability of outerplanar graphs
cites work: Linear algorithms to recognize outerplanar and maximal outerplanar graphs
DOI: 10.1007/S00453-022-00956-6
Recommended article: Combinatorial bounds for conflict-free coloring on open neighborhoods
Recommended article: Conflict-free coloring: graphs of bounded clique width and intersection graphs
Recommended article: A tight bound for conflict-free coloring in terms of distance to cluster
Recommended article: Parameterized Complexity of Conflict-Free Graph Coloring
description: scientific article; zbMATH DE number 7567458