Decomposing infinite 2-connected graphs into 3-connected components

zbMath1058.05053MaRDI QIDQ1883635

R. Bruce Richter

Publication date: 13 October 2004

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/124309

zbMATH Keywords

decompositionconnectivityinfinite planar graphs

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40)

Related Items (4)

Vertex Cuts ⋮ The structure of 2-separations of infinite matroids ⋮ Splitting groups with cubic Cayley graphs of connectivity two ⋮ Generating the cycle space of planar graphs

This page was built for publication: Decomposing infinite 2-connected graphs into 3-connected components