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

arXiv2303.04648MaRDI QIDQ6428835FDOQ6428835

Authors: Yingli Kang, Hongkai Lu, Li-Gang Jin 

Publication date: 8 March 2023

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.

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

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)