Coloring \(k\)-partite sparse digraphs
type: Item
instance of: scholarly article
title: Coloring \(k\)-partite sparse digraphs
zbMATH Open document ID: 1540.05059
author: Ararat Harutyunyan
author: Louisa Harutyunyan
author: Narek Hovhannisyan
published in: Discrete Applied Mathematics
publication date: 2024-05-29T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05C42
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 7855807
zbMATH Keywords: graph coloring
zbMATH Keywords: dichromatic number
zbMATH Keywords: \(k\)-partite digraphs
MaRDI profile type: Publication
cites work: The diachromatic number of digraphs
cites work: Hajós and Ore constructions for digraphs
cites work: List coloring digraphs
cites work: The circular chromatic number of a digraph
cites work: Q3882513
cites work: Gallai's Theorem for List Coloring of Digraphs
cites work: Two results on the digraph chromatic number
cites work: A flow theory for the dichromatic number
cites work: The Effect of Number of Hamiltonian Paths on the Complexity of a Vertex-Coloring Problem
cites work: The dichromatic number of a digraph
DOI: 10.1016/J.DAM.2024.04.005
description: scientific article; zbMATH DE number 7855807