Induced forests in cubic graphs

DOI10.1016/0012-365X(84)90115-8zbMATH Open0536.05015MaRDI QIDQ791532FDOQ791532

Authors: William Staton 

Publication date: 1984

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

Recommendations

• Lower Bounds For Induced Forests in Cubic Graphs
• On the maximum induced forests of a connected cubic graph without triangles
• Size of the largest induced forest in subcubic graphs of girth at least four and five
• On the number of forests and connected spanning subgraphs
• Large induced forests in graphs

zbMATH Keywords

cubic graphgirthforestindependence ratio

Mathematics Subject Classification ID

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

Cites Work

• The point-arboricity of a graph
• The Independence Ratio of Regular Graphs
• Title not available (Why is that?)
• Girth and Independence Ratio
• Title not available (Why is that?)
• On the independence ratio of a graph

Cited In (12)

• Lower Bounds For Induced Forests in Cubic Graphs
• The k-conversion number of regular graphs
• Maximum genus and maximum nonseparating independent set of a 3-regular graph
• Induced path factors of regular graphs
• Induced graphs of uniform spanning forests
• On the maximum induced forests of a connected cubic graph without triangles
• Cycle-compelling colorings of graphs
• A lower bound on the \(k\)-conversion number of graphs of maximum degree \(k+1\)
• Subgraph-avoiding minimum decycling sets and \(k\)-conversion sets in graphs
• Dominating and large induced trees in regular graphs
• The maximum genus of a 3-regular simplicial graph
• Induced forests in bipartite planar graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q791532)