On matroids on edge sets of graphs with connected subgraphs as circuits. II

DOI10.1016/0012-365X(75)90095-3zbMath0307.05129MaRDI QIDQ1217718

J. M. S. Simões-Pereira

Publication date: 1975

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

Mathematics Subject Classification ID

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

Related Items (21)

Recognizing a class of bicircular matroids ⋮ Biased graphs. VII: Contrabalance and antivoltages ⋮ A Generalisation of the Matroid Lift Construction ⋮ Infinite subgraphs as matroid circuits ⋮ Generation of all randomizations using circuits ⋮ The structure of bases in bicircular matroids ⋮ Signed graphs ⋮ Construction of matroidal families by partly closed sets ⋮ Biased graphs. II: The three matroids ⋮ Representations of bicircular matroids ⋮ Noether normalizations, reductions of ideals, and matroids ⋮ Recognizing hidden bicircular networks ⋮ Subgraphs as circuits and bases of matroids ⋮ Matroids from directed graphs ⋮ Linear codes over signed graphs ⋮ On matroidal families ⋮ Biased graphs. I: Bias, balance, and gains ⋮ Equivalent factor matroids of graphs ⋮ Uncovering generalized-network structure in matrices ⋮ A characterization of matroidal families of multigraphs ⋮ Connectivity in bicircular matroids

Cites Work

• Parallel concepts in graph theory
• On subgraphs as matroid cells
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On matroids on edge sets of graphs with connected subgraphs as circuits. II