A complexity dichotomy for critical values of the b-chromatic number of graphs
From MaRDI portal
Publication:5092395
DOI10.4230/LIPIcs.MFCS.2019.34OpenAlexW3006317581MaRDI QIDQ5092395
Publication date: 21 July 2022
Full work available at URL: https://arxiv.org/pdf/1811.03966
Related Items
Cites Work
- Unnamed Item
- On the parameterized complexity of b-\textsc{chromatic number}
- Fundamentals of parameterized complexity
- The b-chromatic number of a graph
- Classifying \(k\)-edge colouring for \(H\)-free graphs
- \(b\)-coloring of tight graphs
- On the Grundy and \(b\)-chromatic numbers of a graph
- Graphs of girth at least 7 have high \(b\)-chromatic number
- On the \(b\)-continuity property of graphs
- Hard coloring problems in low degree planar bipartite graphs
- Filling the Complexity Gaps for Colouring Planar and Bounded Degree Graphs
- Set Partitioning via Inclusion-Exclusion
- Coloring Graphs with Constraints on Connectivity
- Reducibility among Combinatorial Problems
- Parameterized Algorithms
