✦ LIBER ✦

On sign-invariance graphs of uniform oriented matroids

✍ Scribed by Raul Cordovil; Pierre Duchet

Publisher: Elsevier Science
Year: 1990
Tongue: English
Weight: 453 KB
Volume: 79
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(90)90333-d

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Total Polynomials of Uniform Oriented Ma

Total Polynomials of Uniform Oriented Matroids

✍ Jim Lawrence 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 120 KB

In this paper we introduce polynomials associated with uniform oriented matroids whose coefficients enumerate cells in the corresponding arrangements. These polynomials are quite useful in the study of many enumeration problems of combinatorial geometry, such as counting faces of polytopes, counting

On matroid separations of graphs

✍ Klaus Truemper 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 308 KB

Let K be a connected and undirected graph, and M be the polygon matroid of K . Assume that, for some k 2 1, the matroid M is kseparable and k-connected according to the matroid separability and connectivity definitions of W. T. Tutte. In this paper we classify the matroid kseparations of M in terms

Transversals of circuits and acyclic ori

Transversals of circuits and acyclic orientations in graphs and matroids

✍ C. Berge; M. Las Vergnas 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 132 KB

On the oriented chromatic index of orien

On the oriented chromatic index of oriented graphs

✍ Pascal Ochem; Alexandre Pinlou; Éric Sopena 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 227 KB

## Abstract A homomorphism from an oriented graph __G__ to an oriented graph __H__ is a mapping $\varphi$ from the set of vertices of __G__ to the set of vertices of __H__ such that $\buildrel {\longrightarrow}\over {\varphi (u) \varphi (v)}$ is an arc in __H__ whenever $\buildrel {\longrightarrow}

On the Structure of 3-connected Matroids

On the Structure of 3-connected Matroids and Graphs

✍ James Oxley; Haidong Wu 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 249 KB

An element e of a 3-connected matroid M is essential if neither the deletion M\e nor the contraction M/e is 3-connected. Tutte's Wheels and Whirls Theorem proves that the only 3-connected matroids in which every element is essential are the wheels and whirls. In this paper, we consider those 3-conne

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.