Extremal critically connected matroids

DOI10.1016/0012-365X(74)90109-5zbMATH Open0278.05027OpenAlexW1999806023MaRDI QIDQ1394352FDOQ1394352

Authors: U. S. R. Murty 

Publication date: 1974

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

Full work available at URL: https://doi.org/10.1016/0012-365x(74)90109-5

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Graph theory (05Cxx)

Cites Work

• Lectures on matroids
• Minimally 2-connected graphs.
• On Minimal Blocks
• Title not available (Why is that?)

Cited In (19)

• Paths in circuit graphs of matroids
• On Connectivity in Matroids and Graphs
• Elements belonging to triads in 3-connected matroids
• Ear‐decompositions, minimally connected matroids and rigid graphs
• Characterizations of matroids with an element lying in a restricted number of circuits
• On extremal connectivity properties of unavoidable matroids
• The connectivity and minimum degree of circuit graphs of matroids
• On critical circuits in \(k\)-connected matroids
• Cycles in circuit graphs of matroids
• Hamilton cycles in circuit graphs of matroids
• On some extremal connectivity results for graphs and matroids
• Some Local Extremal Connectivity Results for Matroids
• Small Cocircuits in Minimally Vertically 4-Connected Matroids
• Minimally globally rigid graphs
• On packing minors into connected matroids
• Some extremal connectivity results for matroids
• On minor-minimally-connected matroids
• On a matroid generalization of graph connectivity
• On minimally \(k\)-connected matroids

This page was built for publication: Extremal critically connected matroids

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