Packing 3-Vertex Paths in 2-Connected Graphs
classification
🧮 math.CO
keywords
connectedgraphsvertexbipartiteconstructioncopiescubicdisjoint
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.