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

DOI10.1016/J.IPL.2015.07.013zbMATH Open1338.05095OpenAlexW1431483493MaRDI QIDQ495674FDOQ495674

Yi Wang, Chuandong Xu, Shenggui 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

Recommendations

• Arc-chromatic number of digraphs in which every vertex has bounded outdegree or bounded indegree
• Upper bounds of the arc-chromatic number of tournaments
• On the lower bound of \(k\)-maximal digraphs
• A note on coloring digraphs of large girth
• ON THE DICHROMATIC INDEX OF A DIGRAPH

zbMATH Keywords

digraphcombinatorial problemsindegreeoutdegreearc-chromatic number

Mathematics Subject Classification ID

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

Cites Work

• Graph theory
• Maximum directed cuts in acyclic digraphs
• Maximum directed cuts in digraphs with degree restriction
• 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
• Arc colorings of digraphs
• On the arc-chromatic number of a digraph
• Arc-chromatic number of digraphs in which every vertex has bounded outdegree or bounded indegree

Cited In (2)

• The extremal sizes of arc-maximal \((k, \ell)\)-digraphs
• Arc-chromatic number of digraphs in which every vertex has bounded outdegree or bounded indegree

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q495674)