JOURNAL BROWSE
Search
Advanced SearchSearch Tips
LOCALLY SEMICOMPLETE DIGRAPHS WITH A FACTOR COMPOSED OF k CYCLES
facebook(new window)  Pirnt(new window) E-mail(new window) Excel Download
 Title & Authors
LOCALLY SEMICOMPLETE DIGRAPHS WITH A FACTOR COMPOSED OF k CYCLES
Gould, Ronald J.; Guo, Yubao;
  PDF(new window)
 Abstract
A digraph is locally semicomplete if for every vertex , the set of in-neighbors as well as the set of out-neighbors of induce semicomplete digraphs. Let D be a k-connected locally semicomplete digraph with k 3 and g denote the length of a longest induced cycle of D. It is shown that if D has at least 7(k-1)g vertices, then D has a factor composed of k cycles; furthermore, if D is semicomplete and with at least 5k + 1 vertices, then D has a factor composed of k cycles and one of the cycles is of length at most 5. Our results generalize those of [3] for tournaments to locally semicomplete digraphs.
 Keywords
cycle;factor;strong connectivity;locally semicomplete digraph;
 Language
English
 Cited by
1.
Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphs, Discrete Mathematics, 2009, 309, 18, 5655  crossref(new windwow)
2.
Cycle factors in strongly connected local tournaments, Discrete Mathematics, 2010, 310, 4, 850  crossref(new windwow)
3.
All 2-connected in-tournaments that are cycle complementary, Discrete Mathematics, 2008, 308, 11, 2115  crossref(new windwow)
 References
1.
J. Bang-Jensen, Locally semicomplete digraphs: A generalization of tournaments, J. Graph Theory 14 (1990), 371–390. crossref(new window)

2.
J. Bang-Jensen, Y. Guo, G. Gutin and L. Volkmann, A classification of locally semicomplete digraphs, Discrete Math. 167/168 (1997), 101–114. crossref(new window)

3.
G.-T. Chen, R. J. Gould and H. Li, Partitioning Vertices of a Tournament into Independent Cycles, J. Combin. Theory Ser. B 83 (2001), 213–220 crossref(new window)

4.
Y. Guo, Locally Semicomplete Digraphs. PhD thesis, RWTH Aachen, Germany. Aachener Beitrage zur Mathematik, Band 13, Augustinus-Buchhandlung achen, 1995

5.
Y. Guo and L. Volkmann, On complementary cycles in locally semicomplete digraphs, Discrete Math. 135 (1994), 121–127 crossref(new window)

6.
Y. Guo and L. Volkmann, Locally semicomplete digraphs that are complementary m-pancyclic, J. Graph Theory 21 (1996), 121–136 crossref(new window)

7.
J. W. Moon, On subtournaments of a tournament, Canad. Math. Bull. 9 (1996), 297–301 crossref(new window)

8.
K. B. Reid, Two complementary circuits in two-connected tournaments, Ann. Discrete Math. 27 (1985), 321–334 crossref(new window)

9.
Z.-M. Song, Complementary cycles of all lengths in tournaments, J. Combin. Theory Ser. B 57 (1993), 18–25 crossref(new window)