The planar 3-path vertex cover conjecture
Statement
Let be a planar graph of order , and let denote its 3-path vertex cover number.
Planar 3-path vertex cover conjecture.
This conjecture was first mentioned by Brešar et al. in 2011. Equality is attained by, for example, vertex-disjoint unions of octahedron graphs arranged in a planar way; the conjecture remains open in the source.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.