Cycles intersecting edge-cuts of prescribed sizes

zbMATH Open1192.05115MaRDI QIDQ3576709FDOQ3576709

Authors: Tomáš Kaiser, Riste Škrekovski 

Publication date: 30 July 2010

Full work available at URL: https://www.dmtcs.org/dmtcs-ojs/index.php/proceedings/article/view/dmAE0160/0.html

Recommendations

• Cycles Intersecting Edge-Cuts of Prescribed Sizes
• Short cycle covers on cubic graphs by choosing a 2-factor
• Short Cycle Covers of Cubic Graphs and Intersecting 5-Circuits
• scientific article; zbMATH DE number 1790882
• Short cycle covers of cubic graphs

zbMATH Keywords

graphcycleedge-cutcoverable setcovering cycle

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cited In (4)

• Cyclic cutwidths of the two-dimensional ordinary and cylindrical meshes
• Polyhedron of triangle-free simple 2-matchings in subcubic graphs
• T‐joins intersecting small edge‐cuts in graphs
• Cycles Intersecting Edge-Cuts of Prescribed Sizes

This page was built for publication: Cycles intersecting edge-cuts of prescribed sizes

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