Small H-Coloring Problems for Bounded Degree Digraphs

DOI10.1007/978-3-642-38768-5_51zbMath1382.68111arXiv1211.6466OpenAlexW2962831170MaRDI QIDQ4925272

Aurosish Mishra, Pavol Hell

Publication date: 11 June 2013

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1211.6466

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Coloring of graphs and hypergraphs (05C15)

Related Items (1)

\(H\)-coloring degree-bounded (acyclic) digraphs

This page was built for publication: Small H-Coloring Problems for Bounded Degree Digraphs