NP-completeness of planar linear arboricity at maximum degree four
Statement
Let be a planar graph with maximum degree . Its linear arboricity is the minimum number of linear forests whose union is the edge set of .
Planar degree-four linear arboricity complexity conjecture. It is NP-complete to determine whether
The paper identifies this as the only remaining case in its discussion of planar graphs: the cases of odd maximum degree are immediate, maximum degree at least are settled by the main theorem, and the planar linear arboricity conjecture would settle maximum degrees and .
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.