✦ LIBER ✦

Transversals of circuits and acyclic orientations in graphs and matroids

✍ Scribed by C. Berge; M. Las Vergnas

Publisher: Elsevier Science
Year: 1984
Tongue: English
Weight: 132 KB
Volume: 50
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(84)90038-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On removable circuits in graphs and matr

On removable circuits in graphs and matroids

✍ Lemos, Manoel; Oxley, James 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 283 KB

Mader proved that every 2-connected simple graph G with minimum degree d exceeding three has a cycle C, the deletion of whose edges leaves a 2-connected graph. Jackson extended this by showing that C may be chosen to avoid any nominated edge of G and to have length at least d-1. This article proves

Cocircuit Graphs and Efficient Orientati

Cocircuit Graphs and Efficient Orientation Reconstruction in Oriented Matroids

✍ Eric Babson; Lukas Finschi; Komei Fukuda 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 294 KB

We consider the cocircuit graph G M of an oriented matroid M, which is the 1-skeleton of the cell complex formed by the span of the cocircuits of M. As a result of Cordovil, Fukuda, and Guedes de Oliveira, the isomorphism class of M is not determined by G M , but it is determined if M is uniform and

Cycle lengths and circuit matroids of gr

Cycle lengths and circuit matroids of graphs

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

Acyclic and oriented chromatic numbers o

Acyclic and oriented chromatic numbers of graphs

✍ Kostochka, A. V.; Sopena, E.; Zhu, X. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 121 KB 👁 2 views

The oriented chromatic number χ o ( G) of an oriented graph G = (V, A) is the minimum number of vertices in an oriented graph H for which there exists a homomorphism of G to H. The oriented chromatic number χ o (G) of an undirected graph G is the maximum of the oriented chromatic numbers of all the

On unavoidable digraphs in orientations

On unavoidable digraphs in orientations of graphs

✍ Gary S. Bloom; Stefan A. Burr 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 480 KB

Independent edges in bipartite graphs ob

Independent edges in bipartite graphs obtained from orientations of graphs

✍ J. G. Gimbel; K. B. Reid 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 800 KB

## Abstract Given a digraph __D__ on vertices __v__~1~, __v__~2~, ⃛, __v__~__n__~, we can associate a bipartite graph __B(D)__ on vertices __s__~1~, __s__~2~, ⃛, __s__~__n__~, __t__~1~, __t__~2~, ⃛, __t__~__n__~, where __s__~__i__~__t__~__j__~ is an edge of __B(D)__ if (__v__~__i__~, __v__~__j__~)