Path-factors involving paths of order seven and nine
In this paper, we show the following two theorems (here $c_{i}(G-X)$ is the number of components $C$ of $G-X$ with $|V(C)|=i$): (i)~If a graph $G$ satisfies $c_{1}(G-X)+\frac{1}{3}c_{3}(G-X)+\frac{1}{3}c_{5}(G-X)\leq \frac{2}{3}|X|$ for all $X\subseteq V(G)$, then $G$ has a $\{P_{2},P_{7}\}$-factor....
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Georgia Southern University
2016-01-01
|
| Series: | Theory and Applications of Graphs |
| Subjects: | |
| Online Access: | https://digitalcommons.georgiasouthern.edu/tag/vol3/iss1/5 |