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

DOI10.1002/JGT.20189zbMATH Open1116.05025OpenAlexW4247166723MaRDI QIDQ3418196FDOQ3418196

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

Recommendations

• On the maximum arc-chromatic number of digraphs with bounded outdegrees or indegrees
• scientific article; zbMATH DE number 5238183
• Acyclic edge chromatic number of outerplanar graphs
• Arc‐disjoint in‐ and out‐branchings in digraphs of independence number at most 2
• Vertex-distinguishing proper arc colorings of digraphs
• Bounds on the generalised acyclic chromatic numbers of bounded degree graphs
• The \(b\)-chromatic number of certain graphs and digraphs
• The smallest number of vertices in a 2-arc-strong digraph without pair of arc-disjoint in- and out-branchings
• Restricted domination in arc-colored digraphs
• The chromatic index of proper circular-arc graphs of odd maximum degree which are chordal

zbMATH Keywords

digrapharc-chromatic numberfunction theorymaximum outdegree

Mathematics Subject Classification ID

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

Cited In (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

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