The r-reduced cutting numbers and cutting powers of cycles, sequences of cycles and graphs

zbMATH Open1231.05154MaRDI QIDQ3015657FDOQ3015657

Authors: Brad Bailey, Dianna J. Spence 

Publication date: 13 July 2011

Recommendations

• Edge-cut cycles and cutting numbers of cycles and graphs
• On bounds for the cutting number of a graph
• Decycling powers of paths and of cycles
• Maximum cuts in \(\mathscr{H} \)-free graphs
• On the number of cut-vertices in a graph

zbMATH Keywords

connectivitycyclescutting numbercutting power

Mathematics Subject Classification ID

Paths and cycles (05C38) Connectivity (05C40)

Cited In (2)

• Edge-cut cycles and cutting numbers of cycles and graphs
• Path elongation, constructions, and a progression of \(\mathrm{pe}\) values in a single graph

This page was built for publication: The \(r\)-reduced cutting numbers and cutting powers of cycles, sequences of cycles and graphs

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