b-coloring parameterized by clique-width
From MaRDI portal
\(b\)-coloring parameterized by clique-width
Cites work
- b-coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs
- \(b\)-coloring of tight graphs
- \(k\)-NLC graphs and polynomial algorithms
- A characterization of b-chromatic and partial Grundy numbers by induced subgraphs
- A complexity dichotomy for critical values of the \(b\)-chromatic number of graphs
- Algorithms for Vertex Partitioning Problems on Partial k-Trees
- Clique-width of graphs defined by one-vertex extensions
- Clique-width. III: Hamiltonian cycle and the odd case of graph coloring
- Complexity of fall coloring for restricted graph classes
- Distance-hereditary graphs
- Edge-b-coloring trees
- Fall colouring of bipartite graphs and Cartesian products of graphs
- Fundamentals of parameterized complexity
- Graph theory
- Graphs of girth at least 7 have high \(b\)-chromatic number
- Graphs with small fall-spectrum
- Grundy distinguishes treewidth from pathwidth
- Handle-rewriting hypergraph grammars
- scientific article; zbMATH DE number 1202982 (Why is no real title available?)
- scientific article; zbMATH DE number 1953103 (Why is no real title available?)
- scientific article; zbMATH DE number 2044928 (Why is no real title available?)
- scientific article; zbMATH DE number 1506511 (Why is no real title available?)
- scientific article; zbMATH DE number 7650943 (Why is no real title available?)
- Independent domatic partitioning or fall coloring of strongly chordal graphs
- Independent domination in graphs: A survey and recent results
- Intractability of clique-width parameterizations
- Maximization coloring problems on graphs with few \(P_4\)
- On the \(b\)-coloring of \(P_{4}\)-tidy graphs
- On the b-coloring of cographs and \(P_{4}\)-sparse graphs
- On the clique-width of graph with few \(P_{4}\)'s
- On the clique-width of some perfect graph classes
- On the complexity of k-SAT
- On the Grundy and b-chromatic numbers of a graph
- On the parameterized complexity of b-\textsc{chromatic number}
- Parameterized algorithms
- The \(b\)-chromatic index of graphs
- The b-chromatic number of a graph
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Upper bounds to the clique width of graphs
- Which problems have strongly exponential complexity?
This page was built for publication: \(b\)-coloring parameterized by clique-width
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7231567)
