The Parameterized Complexity of Oriented Colouring
From MaRDI portal
Publication:2917312
DOI10.4230/DROPS.MEMICS.2009.2350zbMath1247.68098OpenAlexW1567129631MaRDI QIDQ2917312
Publication date: 28 September 2012
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2009/2350/pdf/09006.GanianRobert.2350.pdf/
Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (5)
Acyclic coloring parameterized by directed clique-width ⋮ Parameterized mixed graph coloring ⋮ Homomorphisms to digraphs with large girth and oriented colorings of minimal series-parallel digraphs ⋮ Efficient computation of the oriented chromatic number of recursively defined digraphs ⋮ Oriented coloring on recursively defined digraphs
This page was built for publication: The Parameterized Complexity of Oriented Colouring
