The following pages link to Induced forests in cubic graphs (Q791532):
Displaying 8 items.
- On the maximum induced forests of a connected cubic graph without triangles (Q757394) (← links)
- Maximum genus and maximum nonseparating independent set of a 3-regular graph (Q1377685) (← links)
- The maximum genus of a 3-regular simplicial graph (Q1807872) (← links)
- Dominating and large induced trees in regular graphs (Q2463903) (← links)
- The <i>k</i>-conversion number of regular graphs (Q4956206) (← links)
- A lower bound on the $k$-conversion number of graphs of maximum degree $k+1$ (Q5135732) (← links)
- (Q5197598) (← links)
- Cycle-compelling colorings of graphs (Q6616821) (← links)
