Acyclic coloring parameterized by directed clique-width

DOI10.1007/978-3-030-67899-9_8OpenAlexW3126261623MaRDI QIDQ831699FDOQ831699

Authors Frank Gurski, Dominique Komander, Carolin Rehs 

Publication date 24 March 2022

Full work available at URL https://doi.org/10.1007/978-3-030-67899-9_8

zbMATH Keywords

acyclic coloringpolynomial time algorithmsdirected clique-widthdirected co-graphs

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

• scientific article; zbMATH DE number 1696534 (Why is no real title available?)
• scientific article; zbMATH DE number 2044928 (Why is no real title available?)
• scientific article; zbMATH DE number 1830724 (Why is no real title available?)
• Acyclic Homomorphisms and Circular Colorings of Digraphs
• Arc-disjoint paths in decomposable digraphs
• Are there any good digraph width measures?
• Circular colorings of edge-weighted graphs
• Classes of directed graphs
• Cliquewidth III: the odd case of graph coloring parameterized by cliquewidth
• Comparing linear width parameters for directed graphs
• Computing digraph width measures on directed co-graphs (extended abstract)
• Computing directed Steiner path covers for directed co-graphs (extended abstract)
• Digraph width measures in parameterized algorithmics
• Directed NLC-width
• Fully dynamic recognition algorithm and certificate for directed cographs
• Fundamentals of parameterized complexity
• Graph minors. II. Algorithmic aspects of tree-width
• Graph structure and monadic second-order logic. A language-theoretic approach
• Integer Programming with a Fixed Number of Variables
• Intractability of clique-width parameterizations
• On the Relationship Between Clique-Width and Treewidth
• Oriented coloring on recursively defined digraphs
• Parameterized algorithms for directed modular width
• Perfect digraphs
• Planar digraphs of digirth four are 2-colorable
• The Recognition of Series Parallel Digraphs
• The circular chromatic number of a digraph
• The dichromatic number of a digraph
• The parameterized complexity of oriented colouring
• The rank-width of edge-coloured graphs
• Upper bounds to the clique width of graphs

Cited In (3)

• Twin-distance-hereditary digraphs
• Efficient computation of the oriented chromatic number of recursively defined digraphs
• Digraph coloring and distance to acyclicity

This page was built for publication: Acyclic coloring parameterized by directed clique-width

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