✦ LIBER ✦

The biased graphs whose matroids are binary

✍ Scribed by Thomas Zaslavsky

Publisher: Elsevier Science
Year: 1987
Tongue: English
Weight: 655 KB
Volume: 42
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(87)90051-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the matroids in which all hyperplanes

On the matroids in which all hyperplanes are binary

✍ S.R. Kingan; J.G. Oxley 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 345 KB

In this paper, it is shown that, for a minor-closed class ~ of matroids, the class of matroids in which every hyperplane is in J¢' is itself minor-closed and has, as its excluded minors, the matroids U1,1 @ N such that N is an excluded minor for ,g. This result is applied to the class of matroids of

An infinite set of torus triangulations

An infinite set of torus triangulations of connectivity 5 whose graphs are not uniquely embeddable in the torus

✍ Serge Lavrenchenko 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 165 KB

A graph of a triangulation of the toms is said to be uniquely embeddable in the torus provided all its embeddings are isomorphic as triangulations. An infinite set of toms triangulations of connectivity 5 has been constructed, with graphs that are not uniquely embeddable in the torus.