Graphs, matroids, and geometric lattices
From MaRDI portal
Publication:5598923
DOI10.1016/S0021-9800(70)80025-4zbMath0201.26002OpenAlexW2024448546MaRDI QIDQ5598923
Publication date: 1970
Published in: Journal of Combinatorial Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0021-9800(70)80025-4
Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Combinatorial aspects of matroids and geometric lattices (05B35) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (9)
Chordal characterization of graphic matroids ⋮ Maximal chains in bond lattices ⋮ Hepp's bound for Feynman graphs and matroids ⋮ On the two-dimensional generic rigidity matroid and its dual ⋮ A Characterization of Graphic Matroids Based on Circuit Orderings ⋮ Uniformität des Verbandes der Partitionen ⋮ The proof of, and generalisations to, a conjecture by Baker and Essam ⋮ On theories of Whitney and Tutte ⋮ A circuit characterization of graphic matroids
This page was built for publication: Graphs, matroids, and geometric lattices
