On Connectivity in Matroids and Graphs

DOI10.2307/1998480MaRDI QIDQ3937421zbMATH OpenOpenAlexFDO

Authors James Oxley

Publication date 1981

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

zbMATH Keywords

2-connected matroidminimally 2-connected graph

Mathematics Subject Classification ID

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

Cites work

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

Cited in

(21)

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

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

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