A necessary and sufficient condition for the existence of a path factor every component of which is a path of length at least two

Journal of Combinatorial Theory. Series B

Volumn 88, Issue 2, 2003, Pages 195-218

  Kaneko, Atsushi ^a  

^a KOGAKUIN UNIVERSITY   (Japan)

Author keywords

Factor; Graph; Path factor; P3, P4, P5 factor

Indexed keywords

EID: 0038688016     PISSN: 00958956     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0095-8956(03)00027-3     Document Type: Article

References (6)

1. C. Bazgan, A. H. Benhamdine, H. Li, M. Woźniak, Partitioning vertices of 1-tough graph into paths, preprint.
2. G. Chartrand, L. Lesniak, "Graphs and Digraphs," 2nd Edition, Mathematics Series, Wadsworth&Brooks/Cole, Monterery, 1986.
3. L. Lovász, A note on factor-critical graphs, Studia Sci. Math. Hungar 7 (1972) 279-280.
4. L. Lovász, Combinatorial Problems and Exercises, North-Holland, Amsterdam, 1979.
5. L. Lovász, M.D. Plummer, in: Matching theory, Annals of Discrete Mathematics, Vol. 29, North-Holland, Amsterdam, 1986.
6. H. Wang, Path factors of bipartite graphs, J. Graph Theory 18 (1994) 161-167.