(I,F)-partition of planar graphs without cycles of length 4, 6, or 9

From MaRDI portal
Publication:6428835




Abstract: A graph G is (I,F)-partitionable if its vertex set can be partitioned into two parts such that one part is an independent set, and the other induces a forest. In this paper, we prove that every planar graph without cycles of length 4,6,9 is (I,F)-partitionable.











This page was built for publication: (I,F)-partition of planar graphs without cycles of length 4, 6, or 9

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6428835)