An improved algorithm for cyclic edge connectivity of regular graphs.

MaRDI QIDQ2948062zbMATH OpenFDO

Authors Dingjun Lou, Kangqi Liang

Publication date 29 September 2015

zbMATH Keywords

algorithmcomplexitycyclic edge connectivityregular graphs

Mathematics Subject Classification ID

Connectivity (05C40) Hypergraphs (05C65) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• An efficient algorithm for cyclic edge connectivity of regular graphs.
• A polynomial algorithm for cyclic edge connectivity of cubic graphs
• A polynomial algorithm determining cyclic vertex connectivity of \(k\)-regular graphs with fixed \(k\)
• Algorithm Theory - SWAT 2004
• A polynomial time algorithm for cyclic vertex connectivity of cubic graphs

Cited in

(11)

• An algorithm to construct k-regular k-connected graphs with the maximum k-diameter
• The \(k\)-subconnectedness of planar graphs
• The cubic graphs with finite cyclic vertex connectivity larger than girth
• A polynomial algorithm determining cyclic vertex connectivity of \(k\)-regular graphs with fixed \(k\)
• A polynomial algorithm determining cyclic vertex connectivity of 4-regular graphs
• Characterization of graphs with infinite cyclic edge connectivity
• A square time algorithm for cyclic edge connectivity of planar graphs.
• An efficient algorithm for cyclic edge connectivity of regular graphs.
• scientific article; zbMATH DE number 4083681 (Why is no real title available?)
• Algorithm Theory - SWAT 2004
• Cyclic Vertex (Edge) Connectivity of Burnt Pancake Graphs

This page was built for publication: An improved algorithm for cyclic edge connectivity of regular graphs.

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