Efficient computation of the oriented chromatic number of recursively defined digraphs
From MaRDI portal
Publication:2235732
Recommendations
Cites work
- A complete axiomatisation for the inclusion of series-parallel partial orders
- A partial k-arboretum of graphs with bounded treewidth
- Acyclic and oriented chromatic numbers of graphs
- Acyclic coloring parameterized by directed clique-width
- Arc-disjoint paths in decomposable digraphs
- Are there any good digraph width measures?
- Circular colorings of edge-weighted graphs
- Classes of directed graphs
- Colourings of oriented connected cubic graphs
- Comparing linear width parameters for directed graphs
- Complement reducible graphs
- Computing digraph width measures on directed co-graphs (extended abstract)
- Computing directed Steiner path covers for directed co-graphs (extended abstract)
- Deciding Clique-Width for Graphs of Bounded Tree-Width
- Digraph width measures in parameterized algorithmics
- Digraphs
- Directed NLC-width
- Directed path-width and directed tree-width of directed co-graphs
- Efficient algorithms for minimum weighted colouring of some classes of perfect graphs
- Fixed-Parameter Tractability and Completeness I: Basic Results
- 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
- Homomorphism bounds for oriented planar graphs of given minimum girth
- Homomorphisms and colourings of oriented graphs: an updated survey
- Homomorphisms and oriented colorings of equivalence classes of oriented graphs
- Homomorphisms to digraphs with large girth and oriented colorings of minimal series-parallel digraphs
- scientific article; zbMATH DE number 1696534 (Why is no real title available?)
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 3891425 (Why is no real title available?)
- scientific article; zbMATH DE number 3558962 (Why is no real title available?)
- scientific article; zbMATH DE number 2044928 (Why is no real title available?)
- Integer Programming with a Fixed Number of Variables
- Intractability of clique-width parameterizations
- Linear time solvable optimization problems on graphs of bounded clique-width
- New results on the complexity of oriented colouring on restricted digraph classes
- On characterizations for subclasses of directed co-graphs
- On the Relationship Between Clique-Width and Treewidth
- On width measures and topological problems on semi-complete digraphs
- Oriented cliques and colorings of graphs with low maximum degree
- Oriented coloring in planar, bipartite, bounded degree 3 acyclic oriented graphs
- Oriented coloring of msp-digraphs and oriented co-graphs (extended abstract)
- Oriented coloring on recursively defined digraphs
- Oriented colourings of graphs with maximum degree three and four
- Parameterized algorithms for directed modular width
- Planar digraphs of digirth four are 2-colorable
- Polynomial algorithms for partitioning problems on graphs with fixed clique-width (extended abstract)
- SOFSEM 2006: Theory and Practice of Computer Science
- The chromatic number of oriented graphs
- The circular chromatic number of a digraph
- The dichromatic number of a digraph
- The monadic second order logic of graphs. VI: On several representations of graphs by relational structures
- The oriented chromatic number of Halin graphs
- The parameterized complexity of oriented colouring
- The rank-width of edge-coloured graphs
- The Recognition of Series Parallel Digraphs
- Uniqueness of colorability and colorability of planar 4-regular graphs are NP-complete
- Upper bounds to the clique width of graphs
Cited in
(6)- Oriented coloring on recursively defined digraphs
- Efficient computation of the modular chromatic numbers of trees
- The parameterized complexity of oriented colouring
- Efficient computation of the oriented chromatic number of recursively defined digraphs
- Oriented vertex and arc coloring of edge series-parallel digraphs
- On the absolute and relative oriented clique problems' time complexity
This page was built for publication: Efficient computation of the oriented chromatic number of recursively defined digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2235732)
