Covering the edges of digraphs in \(\mathcal D(3,3)\) and \(\mathcal D(4,4)\) with directed cuts
From MaRDI portal
Publication:418854
DOI10.1016/j.disc.2012.02.001zbMath1242.05105arXiv1109.4671MaRDI 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
Related Items
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