Characterizing minimally 3-connected graphs

DOI10.1007/978-3-031-83864-4_5MaRDI QIDQ7236423zbMATH OpenFDO

Authors Robert J. Kingan, S. R. Kingan

Publication date 29 April 2026

Full work available at URL https://doi.org/10.1007/978-3-031-83864-4_5

zbMATH Keywords

3-connected graphsbridgescompatible setsminimally 3-connected graphstriads

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Connectivity (05C40)

Cites work

• \(N\)-critical matroids
• scientific article; zbMATH DE number 3166039 (Why is no real title available?)
• scientific article; zbMATH DE number 3308985 (Why is no real title available?)
• Minimally 3-connected binary matroids
• Minimally 3-connected graphs
• On contractible and vertically contractible elements in 3-connected matroids and graphs

This page was built for publication: Characterizing minimally 3-connected graphs

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