most citedPacking 3-Vertex Paths in 2-Connected Graphs

1 citations · 2 across the 3 of their papers we have counts for

collaborators
Showing math.COShow all

3 papers · 1 filter

math.CO2008

Packing 3-vertex paths in cubic 3-connected graphs

Alexander Kelmans

Let v(G) and p(G) be the number of vertices and the maximum number of disjoint 3-vertex paths in G, respectively. We discuss the following old Problem: Is the following claim (P) t…

math.CO2007★ 1 cited

Packing 3-Vertex Paths in 2-Connected Graphs

Alexander Kelmans

We give a construction that provides infinitely many 2-connected, cubic, bipartite, and planar graphs G with 3k vertices and such that the number of disjoint copies of a 3-vertex p…

math.CO2007★ 1 cited

Packing 3-Vertex Paths in Claw-Free Graphs

Alexander Kelmans

An L-factor of a graph G is a spanning subgraph of G whose every component is a 3-vertex path. Let v(G) denote the number of vertices of G. A graph is called claw-free if it does n…