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

  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.},

Figures and Tables from this paper

Degrees in Oriented Hypergraphs and Ramsey p-Chromatic Number

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.

Arc colorings and cycles in digraphs

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



Maximum directed cuts in acyclic digraphs

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

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

An inequality for the chromatic number of a graph

The biparticity of a graph

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

Graph Theory with Applications

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

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.