A polynomial algorithm determining cyclic vertex connectivity of 4-regular graphs

DOI10.1007/s10878-019-00400-6zbMath1425.90096OpenAlexW2920974405WikidataQ128235512 ScholiaQ128235512MaRDI QIDQ2424828

Dingjun Lou, Qinglin Yu, Zongrong Qin, Jun Liang

Publication date: 25 June 2019

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-019-00400-6

zbMATH Keywords

4-regular graphtime complexitymaximum flowcyclic vertex connectivity

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27)

Related Items (5)

A polynomial algorithm determining cyclic vertex connectivity of \(k\)-regular graphs with fixed \(k\) ⋮ Cyclic Vertex (Edge) Connectivity of Burnt Pancake Graphs ⋮ The cubic graphs with finite cyclic vertex connectivity larger than girth ⋮ Cycle-connected mixed graphs and related problems ⋮ Cycle-connected mixed graphs and related problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On several sorts of connectivity
• Edge reductions in cyclically \(k\)-connected cubic graphs
• On cyclic edge-connectivity of fullerenes
• Uniform cyclic edge connectivity in cubic graphs
• Lower bound of cyclic edge connectivity for \(n\)-extendability of regular graphs
• A polynomial algorithm determining cyclic vertex connectivity of \(k\)-regular graphs with fixed \(k\)
• Network Flow and Testing Graph Connectivity
• A polynomial time algorithm for cyclic vertex connectivity of cubic graphs
• Algorithm Theory - SWAT 2004

This page was built for publication: A polynomial algorithm determining cyclic vertex connectivity of 4-regular graphs