Lower Bounds For Induced Forests in Cubic Graphs
From MaRDI portal
Publication:3705470
DOI10.4153/CMB-1987-028-5zbMath0582.05020MaRDI QIDQ3705470
No author found.
Publication date: 1987
Published in: Canadian Mathematical Bulletin (Search for Journal in Brave)
Related Items (15)
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 ⋮ Splitting plane graphs to outerplanarity ⋮ Induced forests in some distance-regular graphs ⋮ Broken circuit complexes and hyperplane arrangements ⋮ 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 ⋮ Feedback vertex sets in cubic multigraphs ⋮ The maximum genus of a 3-regular simplicial graph ⋮ On the maximum induced forests of a connected cubic graph without triangles ⋮ The integrity of a cubic graph ⋮ A tight lower bound on the maximum genus of \(3\)-edge connected loopless graphs
This page was built for publication: Lower Bounds For Induced Forests in Cubic Graphs
