Induced forests in cubic graphs

DOI10.1016/0012-365X(84)90115-8zbMath0536.05015MaRDI QIDQ791532

William Staton

Publication date: 1984

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

zbMATH Keywords

cubic graphgirthforestindependence ratio

Mathematics Subject Classification ID

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

Related Items (7)

Unnamed Item ⋮ Maximum genus and maximum nonseparating independent set of a 3-regular graph ⋮ Dominating and large induced trees in regular graphs ⋮ A lower bound on the $k$-conversion number of graphs of maximum degree $k+1$ ⋮ The k-conversion number of regular graphs ⋮ The maximum genus of a 3-regular simplicial graph ⋮ On the maximum induced forests of a connected cubic graph without triangles

Cites Work

• The point-arboricity of a graph
• Girth and Independence Ratio
• The Independence Ratio of Regular Graphs
• On the independence ratio of a graph
• Unnamed Item
• Unnamed Item

This page was built for publication: Induced forests in cubic graphs