3 problems
Let be a planar graph of girth at least five, and let denote its fractional vertex-arboricity. Fractional Kowalik–Luv{z}ar–Škrekovski conjecture. Every planar graph o…
Let be a triangle-free planar graph, and let denote its fractional vertex-arboricity. Fractional Akiyama–Watanabe conjecture. Every triangle-free planar graph has fra…
Let be a planar graph, and let denote its fractional vertex-arboricity. Fractional Albertson–Berman conjecture. Every planar graph has fractional vertex-arboricity at…