Complete acyclic colorings

DOI10.37236/8752zbMath1441.05073arXiv1905.08670OpenAlexW3030182375MaRDI QIDQ2185231

Raphael Steiner, Winfried Hochstättler, Kolja Knauer, Stefan Felsner

Publication date: 4 June 2020

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

adichromatic number of a digraph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20)

Related Items (3)

Extendiendo un resultado de coloraciones de gráficas a coloraciones de digráficas ⋮ On sensitivity in bipartite Cayley graphs ⋮ Achromatic arboricity on complete graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Induced subdivisions in \(K_{s,s}\)-free graphs of large average degree
• Concerning the achromatic number of graphs
• Packing directed circuits
• The diachromatic number of digraphs
• Harmonious chromatic number of directed graphs
• Coloring tournaments: from local to global
• The point-arboricity of a graph
• Homomorphieeigenschaften und mittlere Kantendichte von Graphen
• DICHROMATIC NUMBER AND FRACTIONAL CHROMATIC NUMBER
• On Independent Circuits Contained in a Graph
• Planar Digraphs of Digirth Four are 2-Colorable
• The Point-Arboricity of Planar Graphs
• The chromatic number of random graphs

This page was built for publication: Complete acyclic colorings