Deleting vertices from a 2-connected graph with preserving 2-connectedness

DOI10.1007/s10958-016-2698-0zbMath1337.05066OpenAlexW2297447497MaRDI QIDQ291169

F. Blanchet-Sadri, M. Dambrine

Publication date: 7 June 2016

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

Full work available at URL: https://doi.org/10.1007/s10958-016-2698-0

zbMATH Keywords

decompositon tree of a bipartite graph

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
• On critically h-connected simple graphs
• Critically n-Connected Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Deleting vertices from a 2-connected graph with preserving 2-connectedness