On the decomposition of a 3-connected graph into cyclically 4-edge-connected components

DOI10.1007/S10958-018-3859-0zbMath1393.05215OpenAlexW2804933047MaRDI QIDQ1661499

A. V. Pastor

Publication date: 16 August 2018

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10958-018-3859-0

zbMATH Keywords

tree-like structures

Mathematics Subject Classification ID

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

Cites Work

• The decomposition of graphs into \(k\)-connected components
• The structure of a decomposition of a triconnected graph
• Blocks in \(k\)-connected graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the decomposition of a 3-connected graph into cyclically 4-edge-connected components