Document Type
Lecture
Publication Date
4-28-2010
Abstract
Let A = G1G2 beafamily of graphs. If a graph G has a spanning subgraph H such that each component of H is in A, then H is said to be an A-factor of G. In this talk, we will focus on the path-factors, that is, each Gi in A is a path of length at least one. We will introduce some recent trends in research on the existence of path-factors in graphs and present several new results we obtained on P3P4-factors. At the end of the talk, we will also propose some further research problems.
Relational Format
presentation
Recommended Citation
Li, Xiaojuan, "Some results on path-factors in graphs" (2010). Combinatorics Seminar. 77.
https://egrove.olemiss.edu/math_combinatorics/77
COinS
