1 problem

The forest-path partition conjecture for planar graphs without 4-cycles and 6-cycles
Forest-path partition conjecture. Every planar graph without $4$ -cycles and $6$ -cycles has an $(\mathcal{F}_1,\mathcal{F})$ -partition.
openforest-coloring graph-partitions planar-graphs
0 responses
07

The forest-path partition conjecture for planar graphs without 4-cycles and 6-cycles