On the maximum induced forests of a connected cubic graph without triangles

DOI10.1016/0012-365X(90)90165-EzbMath0723.05048MaRDI QIDQ757394

Mao Lin Zheng, Xiao-Yun Lu

Publication date: 1990

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

cubic graphinduced forest

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35)

Related Items (10)

Unnamed Item ⋮ A feedback vertex set of 2-degenerate graphs ⋮ A new bound on the feedback vertex sets in cubic graphs ⋮ Partial DP-coloring of graphs ⋮ Maximum genus and maximum nonseparating independent set of a 3-regular graph ⋮ Some bounds on the size of maximum G-free sets in graphs ⋮ A lower bound on the $k$-conversion number of graphs of maximum degree $k+1$ ⋮ The k-conversion number of regular graphs ⋮ Feedback vertex sets in cubic multigraphs ⋮ The integrity of a cubic graph

Cites Work

• Induced forests in cubic graphs
• On the nonseparating independent set problem and feedback set problem for graphs with no vertex degree exceeding three
• Lower Bounds For Induced Forests in Cubic Graphs
• On feedback vertex sets and nonseparating independent sets in cubic graphs
• Unnamed Item

This page was built for publication: On the maximum induced forests of a connected cubic graph without triangles