On the maximum induced forests of a connected cubic graph without triangles
From MaRDI portal
Publication:757394
DOI10.1016/0012-365X(90)90165-EzbMath0723.05048MaRDI QIDQ757394
Publication date: 1990
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items
Maximum genus and maximum nonseparating independent set of a 3-regular graph, The integrity of a cubic graph, A new bound on the feedback vertex sets in cubic graphs
Cites Work