Covering the edges of digraphs in \(\mathcal D(3,3)\) and \(\mathcal D(4,4)\) with directed cuts

DOI10.1016/j.disc.2012.02.001zbMath1242.05105arXiv1109.4671OpenAlexW1548770752MaRDI QIDQ418854

Yan Dong Bai, Bin Long Li, Sheng Gui Zhang

Publication date: 30 May 2012

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

Full work available at URL: https://arxiv.org/abs/1109.4671

zbMATH Keywords

coveringdigraphsdirected cutsindegreeoutdegree

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Vertex degrees (05C07)

Related Items (3)

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

Cites Work

• Unnamed Item
• Maximum directed cuts in acyclic digraphs
• Maximum directed cuts in digraphs with degree restriction
• The biparticity of a graph
• An inequality for the chromatic number of a graph

This page was built for publication: Covering the edges of digraphs in \(\mathcal D(3,3)\) and \(\mathcal D(4,4)\) with directed cuts