### 抄録

Let G be a connected graph and let eb(G) and λ(G) denote the number of end-blocks and the maximum number of disjoint 3-vertex paths Λ in G. We prove the following theorems on claw-free graphs: (t1) if G is claw-free and eb(G) ≤ 2 (and in particular, G is 2-connected) then λ(G) = ⌊|V(G)|/3⌋; (t2) if G is claw-free and eb(G) ≥ 2 then λ(G) ≥ ⌊(|V(G)|-eb(G) + 2)/3⌋; and (t3) if G is claw-free and Δ*-free then λ(G) = ⌊|V(G)|/3⌋ (here Δ* is a graph obtained from a triangle Δ by attaching to each vertex a new dangling edge). We also give the following sufficient condition for a graph to have a Λ-factor: Let n and p be integers, 1 ≤ p ≤ n - 2, G a 2-connected graph, and |V(G)| =3n. Suppose that G-S has a Λ-factor for every S ⊆ V(G) such that |S| = 3p and both V(G)-S and S induce connected subgraphs in G. Then G has a Λ-factor.

元の言語 | English |
---|---|

ページ（範囲） | 175-197 |

ページ数 | 23 |

ジャーナル | Journal of Graph Theory |

巻 | 36 |

発行部数 | 4 |

出版物ステータス | Published - 2001 4 |

### ASJC Scopus subject areas

- Mathematics(all)

### これを引用

*Journal of Graph Theory*,

*36*(4), 175-197.

**On packing 3-vertex paths in a graph.** / Kaneko, Atsushi; Kelmans, Alexander; Nishimura, Tsuyoshi.

研究成果: Article

*Journal of Graph Theory*, 巻. 36, 番号 4, pp. 175-197.

}

TY - JOUR

T1 - On packing 3-vertex paths in a graph

AU - Kaneko, Atsushi

AU - Kelmans, Alexander

AU - Nishimura, Tsuyoshi

PY - 2001/4

Y1 - 2001/4

N2 - Let G be a connected graph and let eb(G) and λ(G) denote the number of end-blocks and the maximum number of disjoint 3-vertex paths Λ in G. We prove the following theorems on claw-free graphs: (t1) if G is claw-free and eb(G) ≤ 2 (and in particular, G is 2-connected) then λ(G) = ⌊|V(G)|/3⌋; (t2) if G is claw-free and eb(G) ≥ 2 then λ(G) ≥ ⌊(|V(G)|-eb(G) + 2)/3⌋; and (t3) if G is claw-free and Δ*-free then λ(G) = ⌊|V(G)|/3⌋ (here Δ* is a graph obtained from a triangle Δ by attaching to each vertex a new dangling edge). We also give the following sufficient condition for a graph to have a Λ-factor: Let n and p be integers, 1 ≤ p ≤ n - 2, G a 2-connected graph, and |V(G)| =3n. Suppose that G-S has a Λ-factor for every S ⊆ V(G) such that |S| = 3p and both V(G)-S and S induce connected subgraphs in G. Then G has a Λ-factor.

AB - Let G be a connected graph and let eb(G) and λ(G) denote the number of end-blocks and the maximum number of disjoint 3-vertex paths Λ in G. We prove the following theorems on claw-free graphs: (t1) if G is claw-free and eb(G) ≤ 2 (and in particular, G is 2-connected) then λ(G) = ⌊|V(G)|/3⌋; (t2) if G is claw-free and eb(G) ≥ 2 then λ(G) ≥ ⌊(|V(G)|-eb(G) + 2)/3⌋; and (t3) if G is claw-free and Δ*-free then λ(G) = ⌊|V(G)|/3⌋ (here Δ* is a graph obtained from a triangle Δ by attaching to each vertex a new dangling edge). We also give the following sufficient condition for a graph to have a Λ-factor: Let n and p be integers, 1 ≤ p ≤ n - 2, G a 2-connected graph, and |V(G)| =3n. Suppose that G-S has a Λ-factor for every S ⊆ V(G) such that |S| = 3p and both V(G)-S and S induce connected subgraphs in G. Then G has a Λ-factor.

KW - Claw-free graphs

KW - Path factors

KW - Path packings

UR - http://www.scopus.com/inward/record.url?scp=31244438088&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=31244438088&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:31244438088

VL - 36

SP - 175

EP - 197

JO - Journal of Graph Theory

JF - Journal of Graph Theory

SN - 0364-9024

IS - 4

ER -