Algorithm Theory - SWAT 2004

DOI10.1007/b98413zbMath1095.68619OpenAlexW2615963353MaRDI QIDQ5315376

Jan Kára, Ondřej Pangrác, Zdeněk Dvořák, Daniel Král'

Publication date: 7 September 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b98413

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) 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 \(k\)-regular graphs with fixed \(k\) ⋮ 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 ⋮ Matching theory and Barnette's conjecture

This page was built for publication: Algorithm Theory - SWAT 2004