Conflict-free coloring: graphs of bounded clique width and intersection graphs
type: Item
instance of: scholarly article
title: Conflict-free coloring: graphs of bounded clique width and intersection graphs
DOI: 10.1007/978-3-030-79987-8_7
author: Sriram Bhyravarapu
author: Tim A. Hartmann
author: Subrahmanyam Kalyanasundaram
author: I. Vinod Reddy
publication date: 2022-03-22T00:00:00Z
full work available at URL: https://arxiv.org/abs/2105.08693
Mathematics Subject Classification ID: 68Rxx
Mathematics Subject Classification ID: 68Wxx
zbMATH DE Number: 7495016
MaRDI profile type: Publication
OpenAlex ID: W3183500635
cites work: Conflict-Free Coloring of Graphs
cites work: Distance-hereditary graphs
cites work: Combinatorial bounds for conflict-free coloring on open neighborhoods
cites work: Parameterized complexity of conflict-free graph coloring
cites work: Complement reducible graphs
cites work: Upper bounds to the clique width of graphs
cites work: Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks
cites work: Q5136250
cites work: The Roberts characterization of proper and unit interval graphs
cites work: Complexity of conflict-free colorings of graphs
cites work: A Short Note on Open-Neighborhood Conflict-Free Colorings of Graphs
cites work: Conflict-free coloring of string graphs
cites work: Kneser's conjecture, chromatic number, and homotopy
cites work: Approximating clique-width and branch-width
cites work: Conflict-Free Colourings of Graphs and Hypergraphs
cites work: Parameterized algorithms for conflict-free colorings of graphs
cites work: Conflict-Free Coloring and its Applications
description: scientific article; zbMATH DE number 7495016