Coloring \(k\)-partite sparse digraphs

DOI10.1016/j.dam.2024.04.005zbMATH Open1540.05059MaRDI QIDQ6546412

Ararat Harutyunyan, Narek Hovhannisyan, Louisa Harutyunyan

Publication date: 29 May 2024

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

graph coloringdichromatic number\(k\)-partite digraphs

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20) Density (toughness, etc.) (05C42)

Cites Work

• Unnamed Item
• Two results on the digraph chromatic number
• The diachromatic number of digraphs
• The dichromatic number of a digraph
• Hajós and Ore constructions for digraphs
• A flow theory for the dichromatic number
• Gallai's Theorem for List Coloring of Digraphs
• The Effect of Number of Hamiltonian Paths on the Complexity of a Vertex-Coloring Problem
• The circular chromatic number of a digraph
• List coloring digraphs

This page was built for publication: Coloring \(k\)-partite sparse digraphs