Packing 3-Vertex Paths in 2-Connected Graphs
From MaRDI portal
Publication:6207941
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 page was built for publication: Packing 3-Vertex Paths in 2-Connected Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6207941)
