Backbone colouring of chordal graphs
J\'ulio Ara\'ujo, Nicolas Nisse, Lucas Picasarri-Arrieta

TL;DR
This paper investigates the backbone chromatic number of chordal graphs with various spanning subgraphs, establishing bounds and counterexamples for specific classes and conditions.
Contribution
It provides new bounds for the backbone chromatic number in chordal graphs with bipartite and bounded average degree subgraphs, and presents counterexamples for bipartite cases.
Findings
For interval graphs with each vertex in at most two maximal cliques, the bound holds.
Counterexamples show the bound does not extend to bipartite graphs.
Bounds are established for chordal graphs with subgraphs of bounded average degree and $C_4$-free subgraphs.
Abstract
A proper -colouring of a graph is a function such that for every edge . The chromatic number is the minimum such that there exists a proper -colouring of . Given a spanning subgraph of , a -backbone -colouring of is a proper -colouring of such that for every edge . The -backbone chromatic number is the smallest for which there exists a -backbone -colouring of . In their seminal paper, Broersma et al.~\cite{BFGW07} ask whether, for any chordal graph and any spanning forest of , we have that . In this work, we first show that this is true as long as is bipartite and is an interval graph in which each vertex belongs to at most two…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
