Pages that link to "Item:Q3705470"
From MaRDI portal
The following pages link to Lower Bounds For Induced Forests in Cubic Graphs (Q3705470):
Displayed 13 items.
- A feedback vertex set of 2-degenerate graphs (Q300250) (← links)
- On the maximum induced forests of a connected cubic graph without triangles (Q757394) (← links)
- The maximum genus of a 3-regular simplicial graph (Q1807872) (← links)
- The integrity of a cubic graph (Q1827848) (← links)
- A tight lower bound on the maximum genus of \(3\)-edge connected loopless graphs (Q1864218) (← links)
- A new bound on the feedback vertex sets in cubic graphs (Q1910543) (← links)
- Broken circuit complexes and hyperplane arrangements (Q2435044) (← links)
- Dominating and large induced trees in regular graphs (Q2463903) (← links)
- Feedback vertex sets in cubic multigraphs (Q2515555) (← links)
- Partial DP-coloring of graphs (Q2659213) (← 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)