Covering digraphs with small indegrees or outdegrees by directed cuts

DOI10.1016/J.DISC.2013.04.014MaRDI QIDQ389984zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

digraphscoveringdirected cutsindegreeoutdegree

Mathematics Subject Classification ID

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

Recommendations

• Covering the edges of digraphs in \(\mathcal D(3,3)\) and \(\mathcal D(4,4)\) with directed cuts
• Maximum directed cuts in digraphs with degree restriction
• On maximum edge cuts of connected digraphs
• Maximum directed cuts in acyclic digraphs
• Maximum directed cuts in graphs with degree constraints

Cites work

• Arc colorings of digraphs
• Arc-chromatic number of digraphs in which every vertex has bounded outdegree or bounded indegree
• Covering the edges of digraphs in \(\mathcal D(3,3)\) and \(\mathcal D(4,4)\) with directed cuts
• Graph theory
• Maximum directed cuts in acyclic digraphs
• Maximum directed cuts in digraphs with degree restriction
• On the arc-chromatic number of a digraph
• 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
• scientific article; zbMATH DE number 4101224 (Why is no real title available?)
• 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)