Acyclic coloring parameterized by directed clique-width
From MaRDI portal
Publication:831699
DOI10.1007/978-3-030-67899-9_8OpenAlexW3126261623MaRDI QIDQ831699
Dominique Komander, Carolin Rehs, Frank Gurski
Publication date: 24 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-67899-9_8
Related Items (2)
Twin-distance-hereditary digraphs ⋮ Efficient computation of the oriented chromatic number of recursively defined digraphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fundamentals of parameterized complexity
- Parameterized algorithms for directed modular width
- Are there any good digraph width measures?
- Directed NLC-width
- The dichromatic number of a digraph
- Upper bounds to the clique width of graphs
- Oriented coloring on recursively defined digraphs
- Computing digraph width measures on directed co-graphs (extended abstract)
- Comparing linear width parameters for directed graphs
- The rank-width of edge-coloured graphs
- Digraph width measures in parameterized algorithmics
- Fully dynamic recognition algorithm and certificate for directed cographs
- The Parameterized Complexity of Oriented Colouring
- Arc-Disjoint Paths in Decomposable Digraphs
- Integer Programming with a Fixed Number of Variables
- Intractability of Clique-Width Parameterizations
- Computing Directed Steiner Path Covers for Directed Co-graphs (Extended Abstract)
- Graph minors. II. Algorithmic aspects of tree-width
- The Recognition of Series Parallel Digraphs
- Circular colorings of edge-weighted graphs
- Acyclic Homomorphisms and Circular Colorings of Digraphs
- The circular chromatic number of a digraph
- Classes of Directed Graphs
- Perfect Digraphs
- On the Relationship Between Clique-Width and Treewidth
- Planar Digraphs of Digirth Four are 2-Colorable
This page was built for publication: Acyclic coloring parameterized by directed clique-width