Conflict-free coloring on claw-free graphs and interval graphs

DOI10.4230/LIPICS.MFCS.2022.19MaRDI QIDQ6584013zbMATH OpenFDO

Authors Sriram Bhyravarapu, Subrahmanyam Kalyanasundaram, Rogers Mathew

Publication date 6 August 2024

Full work available at URL https://doi.org/10.4230/LIPICS.MFCS.2022.19

zbMATH Keywords

bipartite graphsclaw-free graphsconflict-free coloringinterval graphs

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cited in

(6)

• Conflict-free coloring: graphs of bounded clique-width and intersection graphs
• On asymptotically tight bound for the conflict-free chromatic index of nearly regular graphs
• Hop domination on subclasses of perfect graphs
• Polynomial time algorithms for hop domination
• Extremal results on conflict-free coloring
• Conflict-free coloring on subclasses of perfect graphs and bipartite graphs

This page was built for publication: Conflict-free coloring on claw-free graphs and interval graphs

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