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

@article{Bai2011CoveringTE, title={Covering the edges of digraphs in D(3, 3) and D(4, 4) with directed cuts}, author={Yandong Bai and Binlong Li and Shenggui Zhang}, journal={Discret. Math.}, year={2011}, volume={312}, pages={1596-1601} }

## 5 Citations

### Degrees in Oriented Hypergraphs and Ramsey p-Chromatic Number

- MathematicsElectron. J. Comb.
- 2012

A far reaching generalization of the family of graphs D(k,m) is considered, in a complementary form, into the context of $r$-uniform hypergraphs, using ageneralization of Hakimi's theorem to $ r$- uniform hyper graphs and by showing some tight connections with the well known Ramsey numbers forhypergraphs.

### On the maximum arc-chromatic number of digraphs with bounded outdegrees or indegrees

- MathematicsInf. Process. Lett.
- 2015

### Arc colorings and cycles in digraphs

- Mathematics
- 2014

In this thesis, we study arc colorings and cycles in digraphs. The following topics are considered: vertex-distinguishing proper arc colorings in digraphs, short cycles in digraphs with forbidden…

## References

SHOWING 1-7 OF 7 REFERENCES

### Maximum directed cuts in acyclic digraphs

- MathematicsJ. Graph Theory
- 2007

It is easily shown that every digraph with m edges has a directed cut of size at least m/4, and that 1/4 cannot be replaced by any larger constant. We investigate the size of the largest directed cut…

### Maximum directed cuts in digraphs with degree restriction

- MathematicsJ. Graph Theory
- 2009

For integers m, k≥1, we investigate the maximum size of a directed cut in directed graphs in which there are m edges and each vertex has either indegree at most k or outdegree at most k. © 2009 Wiley…

### The biparticity of a graph

- MathematicsJ. Graph Theory
- 1977

It is proved that for any graph G, β(G) = {log2χ (G)}.

### Graph Theory with Applications

- Mathematics
- 1977

The burgeoning of Graph Theory was first aware when I studied the 1940 paper of Brooks, Smith, Stone and Tutte in the Duke Mathematical Journal, ostensibly on squared rectangles, all in the Quest of the Perfect Square.

### On The Chromatic Number of Geometric Hypergraphs

- Mathematics, Computer ScienceSIAM J. Discret. Math.
- 2007

It is proved that any finite family of pseudo-discs can be colored with a constant number of colors and the chromatic number of such hypergraphs is initiated.