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)
05C05: Trees
Related Items
A feedback vertex set of 2-degenerate graphs, On the maximum induced forests of a connected cubic graph without triangles, The maximum genus of a 3-regular simplicial graph, The integrity of a cubic graph, A tight lower bound on the maximum genus of \(3\)-edge connected loopless graphs, A new bound on the feedback vertex sets in cubic graphs, Broken circuit complexes and hyperplane arrangements, Dominating and large induced trees in regular graphs, Feedback vertex sets in cubic multigraphs