Amalgamation over uniform matroids
Svatopluk Poljak, Daniel Turzík (1984)
Czechoslovak Mathematical Journal
Similarity:
Svatopluk Poljak, Daniel Turzík (1984)
Czechoslovak Mathematical Journal
Similarity:
Wagner, David G. (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Dukes, W.M.B. (2002)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity:
Wagner, David G. (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Lovász, László, Recski, András
Similarity:
Kiran Dalvi, Y.M. Borse, M.M. Shikare (2011)
Discussiones Mathematicae Graph Theory
Similarity:
In this paper, we prove that an element splitting operation by every pair of elements on a cographic matroid yields a cographic matroid if and only if it has no minor isomorphic to M(K₄).
Wojciech Kordecki, Anna Łyczkowska-Hanćkowiak (2013)
Discussiones Mathematicae Graph Theory
Similarity:
Dohmen [4] gives a simple inductive proof of Whitney’s famous broken circuits theorem. We generalise his inductive proof to the case of matroids
Hliněný, Petr (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity: