Packing 3-Vertex Paths in 2-Connected Graphs

Details Packing 3-Vertex Paths in 2-Connected Graphs Packing 3-Vertex Paths in 2-Connected Graphs

2007-12-26

arxiv.org/abs/0712.4151v1

Mathematics

Combinatorics

13 pages, 14 figures

Scientific paper

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 path in G is less than k.

Affiliated with

Also associated with

No associations

Rating

Packing 3-Vertex Paths in 2-Connected Graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Packing 3-Vertex Paths in 2-Connected Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Packing 3-Vertex Paths in 2-Connected Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-200749