On the Complexity of Ordered Colorings

DOI10.1137/060676222zbMath1223.05073OpenAlexW2020498282MaRDI QIDQ3629479

Jan van den Heuvel, Arvind Kumar Gupta, Xiaohong Zhao, Ján Maňuch, Ladislav Stacho

Publication date: 27 May 2009

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/7f100266cb6ab056403fe272a1cfb25dd43b4f7d

zbMATH Keywords

complexitygraph coloringNP-completenesspolynomial algorithmordered coloringdirected graph homomorphism

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

On the restricted homomorphism problem

This page was built for publication: On the Complexity of Ordered Colorings