Complexity of acyclic colorings of graphs and digraphs with degree and girth constraints
From MaRDI portal
Publication:6321242
arXiv1907.00061MaRDI QIDQ6321242
Tomás Feder, Carlos Subi, Pavol Hell
Publication date: 28 June 2019
Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20)
This page was built for publication: Complexity of acyclic colorings of graphs and digraphs with degree and girth constraints