On the maximum induced forests of a conn
β
Maolin Zheng; Xiaoyun Lu
π
Article
π
1990
π
Elsevier Science
π
English
β 438 KB
Let t(G) denote the cardinality of a maximum induced forest of a graph G with n vertices. For connected simple cubic graphs G without triangles, it is shown that r(G) 3 2n/3 except for two particular graphs. This lower bound is sharp and it improves a result due to J.A. Bondy, et al. [l]. Using this