On Connectivity in Matroids and Graphs

DOI10.2307/1998480zbMath0481.05021OpenAlexW2496286765MaRDI QIDQ3937421

James G. Oxley

Publication date: 1981

Full work available at URL: https://doi.org/10.2307/1998480

zbMATH Keywords

minimally 2-connected graph2-connected matroid

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)

Related Items (20)

Elements belonging to triads in 3-connected matroids ⋮ Some Local Extremal Connectivity Results for Matroids ⋮ On some extremal connectivity results for graphs and matroids ⋮ On 3-connected matroids ⋮ On density-critical matroids ⋮ Uniformly connected graphs ⋮ Ear‐decompositions, minimally connected matroids and rigid graphs ⋮ A matroid analogue of a theorem of Brooks for graphs ⋮ A Torelli theorem for graph isomorphisms ⋮ Minimally 3-connected binary matroids ⋮ A minimal 3-connectedness result for matroids ⋮ Some extremal connectivity results for matroids ⋮ Triads and triangles in 3-connected matroids ⋮ On packing minors into connected matroids ⋮ On extremal connectivity properties of unavoidable matroids ⋮ On minor-minimally-connected matroids ⋮ Distribution of contractible elements in 2-connected matroids ⋮ Matroid packing and covering with circuits through an element ⋮ Special issue in honour of James Oxley ⋮ Generalizing cographs to 2-cographs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On a covering problem of Mullin and Stanton for binary matroids
• Decomposition of regular matroids
• Matroid representation over GF(3)
• Packing and covering with matroid circuits
• Extremal critically connected matroids
• Untersuchungen über minimale \(n\)-fach zusammenhängende Graphen
• Ecken vom Grad \(n\) in minimalen \(n\)-fach zusammenhängenden Graphen
• ON MATROID CONNECTIVITY
• On the chromatic number of binary matroids
• The Bracket Ring of a Combinatorial Geometry. II: Unimodular Geometries
• On certain n-connected matroids.
• COLOURING, PACKING AND THE CRITICAL PROBLEM
• On 3-Connected Matroids
• Connectivity in Matroids
• Minimally 2-connected graphs.
• On Minimal Blocks
• A Combinatorial Model for Series-Parallel Networks
• On the Foundations of Combinatorial Theory II. Combinatorial Geometries

This page was built for publication: On Connectivity in Matroids and Graphs