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

DOI10.1007/S10958-018-3859-0zbMATH Open1393.05215OpenAlexW2804933047MaRDI QIDQ1661499FDOQ1661499

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

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

zbMATH Keywords

tree-like structures

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The decomposition of graphs into \(k\)-connected components
• Blocks in \(k\)-connected graphs
• The structure of a decomposition of a triconnected graph

Cited In (6)

• Decomposition of cubic graphs with cyclic connectivity 5
• Minimal Cyclic-4-Connected Graphs
• Title not available (Why is that?)
• Generating internally four-connected graphs
• Title not available (Why is that?)
• Title not available (Why is that?)

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)