On the minor-minimal 2-connected graphs having a fixed minor

DOI10.1016/j.disc.2003.07.003zbMath1050.05067OpenAlexW2054748467MaRDI QIDQ1827674

Manoel Lemos, James G. Oxley

Publication date: 6 August 2004

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2003.07.003

zbMATH Keywords

Graph minorBlock2-Connected graph

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Combinatorial aspects of matroids and geometric lattices (05B35) Graph minors (05C83)

Cites Work

• Unnamed Item
• Unnamed Item
• On packing minors into connected matroids
• A smallest augmentation to 3-connect a graph
• Augmenting Graphs to Meet Edge-Connectivity Requirements
• Augmentation Problems
• Connectivity in Matroids
• Minimally 2-connected graphs.