✦ LIBER ✦

Infinite graphs and bicircular matroids

✍ Scribed by Laurence R. Matthews; James G. Oxley

Book ID: 107748248
Publisher: Elsevier Science
Year: 1977
Tongue: English
Weight: 522 KB
Volume: 19
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(77)90119-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Infinite matroids in graphs

✍ Henning Bruhn; Reinhard Diestel 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 270 KB

On the structures induced by bipartite g

On the structures induced by bipartite graphs and infinite matroids

✍ E. Győri 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 761 KB

Interval matroids and graphs

✍ F. Jaeger 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 519 KB

A base of the cycle space of a binary matroid M on E is said to be convex if its elements can be totally ordered in such a way that for every e E E tk set of elements of the base containing e is an interval. \'Ure show that a binary matroid is cographic iff it has a convex base of cycles; equivalent

Visibility Graphs and Oriented Matroids

✍ Abello; Kumar 📂 Article 📅 2002 🏛 Springer 🌐 English ⚖ 133 KB

On matroids and hierarchial graphs

✍ David Fernández-Baca; Mark A. Williams 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 601 KB

Antipodal graphs and oriented matroids

✍ Komei Fukuda; Keiichi Handa 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 786 KB

A graph is antipodal if, for every vertex c', there exists exactly one vertex V which is not closer to r than every vertex adjacent to 6. In this paper we consider the problem of characterizing tope graphs of oriented matroids, which constitute a broad class of antipodal graphs. One of the results i