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

Autor:	Kang, Yingli, Lu, Hongkai, Jin, Ligang
Rok vydání:	2023
Předmět:	Mathematics - Combinatorics 05C10 05C15
Druh dokumentu:	Working Paper
Popis:	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. Comment: 9 pages, 5 figures
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/2303.04648 Zobrazit plný text záznamu View this record from Arxiv