✦ LIBER ✦

Bases-cobases graphs and polytopes of matroids

✍ Scribed by R. Cordovil; M. L. Moreira

Publisher: Springer-Verlag
Year: 1993
Tongue: English
Weight: 486 KB
Volume: 13
Category: Article
ISSN: 0209-9683
DOI: 10.1007/bf01303201

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Ehrhart Polynomials of Matroid Polytopes

Ehrhart Polynomials of Matroid Polytopes and

✍ Jesús A. De Loera; David C. Haws; Matthias Köppe 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 127 KB

Ehrhart Polynomials of Matroid Polytopes

Ehrhart Polynomials of Matroid Polytopes and

✍ Jesús A. De Loera; David C. Haws; Matthias Köppe 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 821 KB

Paths and cycles in matroid base graphs

✍ Brian Alspach; Guizhen Liu 📂 Article 📅 1989 🏛 Springer Japan 🌐 English ⚖ 318 KB

A lower bound on connectivities of matro

A lower bound on connectivities of matroid base graphs

✍ Guizhen Liu 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 853 KB

The connectivity of a graph G and the corank of a matroid M are denoted by K(G) and p, respectively. X is shown that if a graph G is the base graph of a simple mat&d M, then K(G) L 2p and the lower bound of 2p izA best possible.

Cycle lengths and circuit matroids of gr

Cycle lengths and circuit matroids of graphs

✍ D.R. Woodall 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 331 KB

Polytopes of Magic Labelings of Graphs a

Polytopes of Magic Labelings of Graphs and the Faces of the Birkhoff Polytope

✍ Maya Mohsin Ahmed 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 435 KB