On subgraphs as matroid cells
From MaRDI portal
Publication:2548961
DOI10.1007/BF01111390zbMath0226.05016MaRDI QIDQ2548961
Publication date: 1972
Published in: Mathematische Zeitschrift (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/171778
Related Items (29)
Bicircular matroids are 3-colorable ⋮ Recognizing a class of bicircular matroids ⋮ Biased graphs. VII: Contrabalance and antivoltages ⋮ A Generalisation of the Matroid Lift Construction ⋮ Graphes équilibrés et arboricité rationnelle. (Balanced graphs and rational arboricity) ⋮ The biased graphs whose matroids are binary ⋮ A primal-dual approach to approximation of node-deletion problems for matroidal properties ⋮ Distributive lattices, polyhedra, and generalized flows ⋮ On the existence of uncountably many matroidal families ⋮ Infinite subgraphs as matroid circuits ⋮ On the revealed preference analysis of stable aggregate matchings ⋮ The structure of bases in bicircular matroids ⋮ Bicircular signed-graphic matroids ⋮ Construction of matroidal families by partly closed sets ⋮ Biased graphs. II: The three matroids ⋮ A Ramsey Theorem for Biased Graphs ⋮ Representations of bicircular matroids ⋮ Characterizing bias matroids ⋮ Recognizing hidden bicircular networks ⋮ On matroids on edge sets of graphs with connected subgraphs as circuits. II ⋮ Subgraphs as circuits and bases of matroids ⋮ On matroids and hierarchical graphs ⋮ On excluded minors of connectivity 2 for the class of frame matroids ⋮ Infinite graphs and bicircular matroids ⋮ Matroids from directed graphs ⋮ Biased graphs. I: Bias, balance, and gains ⋮ Uncovering generalized-network structure in matrices ⋮ A characterization of matroidal families of multigraphs ⋮ Connectivity in bicircular matroids
Cites Work
This page was built for publication: On subgraphs as matroid cells
