Covering digraphs with small indegrees or outdegrees by directed cuts
From MaRDI portal
Publication:389984
DOI10.1016/J.DISC.2013.04.014zbMATH Open1281.05113OpenAlexW2082279367MaRDI QIDQ389984FDOQ389984
Authors: Shenggui Zhang, You Lu, Chuandong 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
Recommendations
Directed graphs (digraphs), tournaments (05C20) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Graph theory
- Maximum directed cuts in acyclic digraphs
- Maximum directed cuts in digraphs with degree restriction
- 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
- The biparticity of a graph
Cited In (7)
- Small cutsets in arc-transitive digraphs of prime degree
- Maximum directed cuts in digraphs with degree restriction
- Title not available (Why is that?)
- Intersection properties of maximal directed cuts in digraphs
- Covering the edges of digraphs in \(\mathcal D(3,3)\) and \(\mathcal D(4,4)\) with directed cuts
- On the maximum arc-chromatic number of digraphs with bounded outdegrees or indegrees
- Maximum directed cuts in graphs with degree constraints
This page was built for publication: Covering digraphs with small indegrees or outdegrees by directed cuts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q389984)
