On the maximum arc-chromatic number of digraphs with bounded outdegrees or indegrees

DOI10.1016/j.ipl.2015.07.013zbMath1338.05095OpenAlexW1431483493MaRDI QIDQ495674

Chuan-Dong Xu, Yi Wang, Sheng Gui Zhang

Publication date: 15 September 2015

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2015.07.013

zbMATH Keywords

digraphcombinatorial problemsindegreeoutdegreearc-chromatic number

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Covering digraphs with small indegrees or outdegrees by directed cuts
• Covering the edges of digraphs in \(\mathcal D(3,3)\) and \(\mathcal D(4,4)\) with directed cuts
• On the arc-chromatic number of a digraph
• Arc colorings of digraphs
• Arc-chromatic number of digraphs in which every vertex has bounded outdegree or bounded indegree
• Maximum directed cuts in acyclic digraphs
• Maximum directed cuts in digraphs with degree restriction

This page was built for publication: On the maximum arc-chromatic number of digraphs with bounded outdegrees or indegrees