Efficient computation of the oriented chromatic number of recursively defined digraphs
From MaRDI portal
Publication:6356974
DOI10.1016/j.tcs.2021.08.013zbMath1514.68218arXiv2012.13764MaRDI QIDQ6356974
Dominique Komander, Frank Gurski, Marvin Lindemann
Publication date: 26 December 2020
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20) Parameterized complexity, tractability and kernelization (68Q27)
This page was built for publication: Efficient computation of the oriented chromatic number of recursively defined digraphs