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

DOI10.1007/S10958-018-3859-0MaRDI QIDQ1661499zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Decomposition of cubic graphs with cyclic connectivity 5
• Non removable edges in 3-connected cubic graphs
• Decomposition of 3-connected graphs
• scientific article; zbMATH DE number 3845616
• Uncontractable 4-connected graphs

Cites work

• Blocks in \(k\)-connected graphs
• scientific article; zbMATH DE number 5161490 (Why is no real title available?)
• scientific article; zbMATH DE number 1960407 (Why is no real title available?)
• scientific article; zbMATH DE number 3236772 (Why is no real title available?)
• scientific article; zbMATH DE number 3290993 (Why is no real title available?)
• The decomposition of graphs into \(k\)-connected components
• The structure of a decomposition of a triconnected graph

Cited in

(7)

• Generating internally four-connected graphs
• Decomposition of cubic graphs with cyclic connectivity 5
• Decomposition of 3-connected graphs
• Minimal Cyclic-4-Connected Graphs
• scientific article; zbMATH DE number 475619 (Why is no real title available?)
• scientific article; zbMATH DE number 7362657 (Why is no real title available?)
• scientific article; zbMATH DE number 7274058 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1661499)