Premium
Digraphs containing every possible pair of dicycles
Author(s) -
Wang Hong
Publication year - 2000
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/1097-0118(200006)34:2<154::aid-jgt4>3.0.co;2-l
Subject(s) - combinatorics , mathematics , disjoint sets , graph , degree (music) , vertex (graph theory) , discrete mathematics , physics , acoustics
Let D = ( V , A ) be a directed graph of order n ≥ 4. Suppose that the minimum degree of D is at least (3 n − 3)/2. Then for any two integers s and t with s ≥ 2, t ≥ 2 and s + t ≤ n , D contains two vertex‐disjoint directed cycles of lengths s and t , respectively. Moreover, the condition on the minimum degree is sharp. © 2000 John Wiley & Sons, Inc. J Graph Theory 34: 154–162, 2000