Covering digraphs with small indegrees or outdegrees by directed cuts

DOI10.1016/j.disc.2013.04.014zbMath1281.05113OpenAlexW2082279367MaRDI QIDQ389984

You Lu, Sheng Gui Zhang, Chuan-Dong Xu

Publication date: 22 January 2014

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2013.04.014

zbMATH Keywords

coveringdigraphsdirected cutsindegreeoutdegree

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20)

Related Items (2)

Intersection properties of maximal directed cuts in digraphs ⋮ On the maximum arc-chromatic number of digraphs with bounded outdegrees or indegrees

Cites Work

• 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
• The biparticity of a graph
• Unnamed Item

This page was built for publication: Covering digraphs with small indegrees or outdegrees by directed cuts