Induced cycles in graphs

From MaRDI portal
(Redirected from Publication:503635)




Abstract: The maximum cardinality of an induced 2-regular subgraph of a graph G is denoted by cmind(G). We prove that if G is an r-regular graph of order n, then cmind(G)geqfracn2(r1)+frac1(r1)(r2) and we prove that if G is a cubic claw-free graph on order n, then cmind(G)>13n/20 and this bound is asymptotically best possible.









This page was built for publication: Induced cycles in graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q503635)