A polynomial algorithm determining cyclic vertex connectivity of \(k\)-regular graphs with fixed \(k\)

DOI10.1007/s10878-018-0332-4zbMath1420.05084OpenAlexW2887446137WikidataQ129359137 ScholiaQ129359137MaRDI QIDQ2424662

Jun Liang, Dingjun Lou

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-018-0332-4

zbMATH Keywords

time complexitymaximum flow\(k\)-regular graphcyclic vertex connectivity

Mathematics Subject Classification ID

Graph polynomials (05C31) Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40)

Related Items (6)

The \(k\)-subconnectedness of planar graphs ⋮ A polynomial algorithm determining cyclic vertex connectivity of 4-regular graphs ⋮ The cubic graphs with finite cyclic vertex connectivity larger than girth ⋮ Characterization of \(k\)-subconnected graphs ⋮ 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
• A polynomial algorithm determining cyclic vertex connectivity of 4-regular graphs
• A non-Hamiltonian planar graph
• Network Flow and Testing Graph Connectivity
• Decompositions and reductions of snarks
• 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 \(k\)-regular graphs with fixed \(k\)