On elements in small cocircuits in minimally k-connected graphs and matroids

DOI10.1016/S0012-365X(01)00220-5MaRDI QIDQ5957720zbMATH OpenFDO

Authors Talmage James Reid, Haidong Wu

Publication date 19 June 2002

Published in Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

extremal graphsmatroidminimally \(k\)-connected graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Combinatorial aspects of matroids and geometric lattices (05B35) Connectivity (05C40)

Recommendations

• The number of vertices of degree \(k\) in a minimally \(k\)-edge connected graph
• On Vertices of Degree n in Minimally n-Edge-Connected Graphs
• Small Cocircuits in Minimally Vertically 4-Connected Matroids
• Tight bounds for the vertices of degree k in minimally k‐connected graphs

Cited in

(8)

• Ear‐decompositions, minimally connected matroids and rigid graphs
• Minimal \(k\)-connected graphs with small number of vertices of degree \(k\)
• The number of vertices of degree \(k\) in a minimally \(k\)-edge connected graph
• Elements belonging to triangles in 3-connected matroids
• On critical circuits in \(k\)-connected matroids
• Elements belonging to triads in 3-connected matroids
• The number of elements belonging to triads in 3-connected binary matroids
• On minimally \(k\)-connected matroids

This page was built for publication: On elements in small cocircuits in minimally \(k\)-connected graphs and matroids

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