Covering digraphs with small indegrees or outdegrees by directed cuts
type: Item
instance of: scholarly article
title: Covering digraphs with small indegrees or outdegrees by directed cuts
zbMATH Open document ID: 1281.05113
author: Shenggui Zhang
author: You Lu
author: Chuandong Xu
published in: Discrete Mathematics
publication date: 2014-01-22T00:00:00Z
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C20
zbMATH DE Number: 6248996
zbMATH Keywords: covering
zbMATH Keywords: directed cuts
zbMATH Keywords: digraphs
zbMATH Keywords: indegree
zbMATH Keywords: outdegree
MaRDI profile type: Publication
full work available at URL: j.disc.2013.04.014
OpenAlex ID: W2082279367
cites work: Maximum directed cuts in acyclic digraphs
cites work: Covering the edges of digraphs in \(\mathcal D(3,3)\) and \(\mathcal D(4,4)\) with directed cuts
cites work: Arc-chromatic number of digraphs in which every vertex has bounded outdegree or bounded indegree
cites work: Q5422499
cites work: The biparticity of a graph
cites work: Arc colorings of digraphs
cites work: Maximum directed cuts in digraphs with degree restriction
cites work: On the arc-chromatic number of a digraph
DOI: 10.1016/J.DISC.2013.04.014
description: scientific article; zbMATH DE number 6248996