Vertex-disjoint cycles containing specified edges

Graphs and Combinatorics

Volumn 16, Issue 1, 2000, Pages 81-92

  Egawa, Yoshimi ^a   Faudree, Ralph J ^b   Györi, Ervin ^c   Ishigami, Yoshiyasu ^d,f   Schelp, Richard H ^b   Wang, Hong ^e  

^a TOKYO UNIVERSITY OF SCIENCE   (Japan)

^b University of Memphis   (United States)

^c INSTITUTE OF EXPERIMENTAL MEDICINE   (Hungary)

^d UNIVERSITY OF ELECTRO COMMUNICATIONS   (Japan)

^e UNIVERSITY OF IDAHO   (United States)

^f UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

2 factor; Cover; Cycle; Partition

Indexed keywords

EID: 0347109874     PISSN: 09110119     EISSN: None     Source Type: Journal    
DOI: 10.1007/s003730050005     Document Type: Article

References (6)

1. Berge, C.: Graphs, Third revised edition, Elsevier Science Publishers B.V., Amsterdam (1991)
2. Egawa, Y., Enomoto, H., Faudree, R., Li, H., Schiermeyer, I.: Two-factors each component of which contains a specified vertex, manuscript
3. Enomoto, H.: private communication (1997)
4. Ore, O.: Note on Hamilton circuits, Am. Math. Mon. 67, 55 (1960)
5. Wang, H.: Covering a graph with cycles passing through given edges, J. Graph Theory 26, 105-109 (1997)
6. Wang, H.: On covering a graph with cycles, manuscript