Conflict-free coloring: graphs of bounded clique width and intersection graphs

DOI10.1007/978-3-030-79987-8_7MaRDI QIDQ2115843zbMATH OpenOpenAlexFDO

Authors Sriram Bhyravarapu, Tim A. Hartmann, Subrahmanyam Kalyanasundaram, I. Vinod Reddy

Publication date 22 March 2022

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

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Discrete mathematics in relation to computer science (68Rxx)

Recommendations

• Conflict-free coloring bounds on open neighborhoods
• Combinatorial bounds for conflict-free coloring on open neighborhoods
• Conflict-free coloring of graphs
• A tight bound for conflict-free coloring in terms of distance to cluster

Cites work

• A short note on open-neighborhood conflict-free colorings of graphs
• Approximating clique-width and branch-width
• Combinatorial bounds for conflict-free coloring on open neighborhoods
• Complement reducible graphs
• Complexity of conflict-free colorings of graphs
• Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks
• Conflict-free coloring and its applications
• Conflict-free coloring of graphs
• Conflict-free coloring of intersection graphs
• Conflict-free coloring of string graphs
• Conflict-free colourings of graphs and hypergraphs
• Distance-hereditary graphs
• Kneser's conjecture, chromatic number, and homotopy
• Parameterized algorithms for conflict-free colorings of graphs
• Parameterized complexity of conflict-free graph coloring
• The Roberts characterization of proper and unit interval graphs
• Upper bounds to the clique width of graphs

Cited in

(7)

• Minimum conflict free colouring parameterized by treewidth
• Conflict-free coloring: graphs of bounded clique-width and intersection graphs
• On \(d\)-stable locally checkable problems parameterized by mim-width
• Conflict-free coloring bounds on open neighborhoods
• Exactly hittable interval graphs
• A short note on conflict‐free coloring on closed neighborhoods of bounded degree graphs
• A tight bound for conflict-free coloring in terms of distance to cluster

This page was built for publication: Conflict-free coloring: graphs of bounded clique width and intersection graphs

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