论文信息 - Disjoint directed quadrilaterals in a directed graph

Disjoint directed quadrilaterals in a directed graph

Let D be a directed graph of order 4k, where k is a positive integer. Suppose that the minimum degree of D is at least 6k 2. We show that D contains k disjoint directed quadrilaterals with only one exception. 2005 Wiley Periodicals, Inc. J Graph Theory 50: 91–104, 2005

Hong Wang | Danhong Zhang

[1] Hong Wang,et al. Independent cycles with limited size in a graph , 1994, Graphs Comb..

[2] Gerald W. Schuster,et al. A Minimum Degree Result for Disjoint Cycles and Forests in Graphs , 1998, Comb..

[3] Ingo Schiermeyer,et al. On quadrilaterals in a graph , 1999, Discret. Math..

[4] Andras Hajnal,et al. On the maximal number of independent circuits in a graph , 1963 .

[5] Hong Wang,et al. On the maximum number of independent cycles in a graph , 1999, Discret. Math..

[6] Mehdi Behzad,et al. Graphs and Digraphs , 1981, The Mathematical Gazette.

[7] Hikoe Enomoto,et al. On the Existence of Disjoint Cycles in a Graph , 1998, Comb..

[8] Stephan Brandt,et al. Subtrees and Subforests of Graphs , 1994, J. Comb. Theory, Ser. B.

[9] Hong Wang,et al. On the Maximum Number of Independent Cycles in a Bipartite Graph , 1996, J. Comb. Theory, Ser. B.

[10] Hong Wang. Independent Directed Triangles in a Directed Graph , 2000, Graphs Comb..