Arc-chromatic number of digraphs in which every vertex has bounded outdegree or bounded indegree

DOI10.1002/jgt.20189zbMath1116.05025OpenAlexW4247166723MaRDI QIDQ3418196

Frédéric Havet, Stéphane Bessy, Etienne Birmelé

Publication date: 2 February 2007

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.20189

zbMATH Keywords

digrapharc-chromatic numberfunction theorymaximum outdegree

Mathematics Subject Classification ID

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

Related Items (3)

Covering digraphs with small indegrees or outdegrees by directed cuts ⋮ A study of 3-arc graphs ⋮ On the maximum arc-chromatic number of digraphs with bounded outdegrees or indegrees

This page was built for publication: Arc-chromatic number of digraphs in which every vertex has bounded outdegree or bounded indegree