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

• Fundamentals of parameterized complexity
• Upper bounds to the clique width of graphs
• Digraph width measures in parameterized algorithmics
• Integer Programming with a Fixed Number of Variables
• Graph structure and monadic second-order logic. A language-theoretic approach
• The circular chromatic number of a digraph
• On the Relationship Between Clique-Width and Treewidth
• Graph minors. II. Algorithmic aspects of tree-width
• The dichromatic number of a digraph
• The Recognition of Series Parallel Digraphs
• Intractability of clique-width parameterizations
• Fully dynamic recognition algorithm and certificate for directed cographs
• Arc-disjoint paths in decomposable digraphs
• Circular colorings of edge-weighted graphs
• Title not available (Why is that?)
• The rank-width of edge-coloured graphs
• Acyclic Homomorphisms and Circular Colorings of Digraphs
• Title not available (Why is that?)
• Perfect Digraphs
• Directed NLC-width
• Planar Digraphs of Digirth Four are 2-Colorable
• Title not available (Why is that?)
• Parameterized algorithms for directed modular width
• Classes of Directed 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 parameterized complexity of oriented colouring
• Computing Directed Steiner Path Covers for Directed Co-graphs (Extended Abstract)
• Title not available (Why is that?)
• Are there any good digraph width measures?

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)