✦ LIBER ✦

On unavoidable digraphs in orientations of graphs

✍ Scribed by Gary S. Bloom; Stefan A. Burr

Publisher: John Wiley and Sons
Year: 1987
Tongue: English
Weight: 480 KB
Volume: 11
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.3190110402

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Orientations of hamiltonian cycles in la

Orientations of hamiltonian cycles in large digraphs

✍ Adam Paweł Wojda 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 328 KB

We prove that, with some exceptions, every digraph with n 3 9 vertices and at least ( n -1) ( n -2) + 2 arcs contains all orientations of a Hamiltonian cycle.

Some remarks on Arc-connectivity, vertex

Some remarks on Arc-connectivity, vertex splitting, and orientation in graphs and digraphs

✍ Bill Jackson 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 309 KB

We apply proof techniques developed by L. Lovasz and A. Frank to obtain several results on the arc-connectivity of graphs and digraphs. The first results concern the operation of splitting two arcs from a vertex of an Eulerian graph or digraph in such a way as to preserve local connectivity conditio

Sinks in Acyclic Orientations of Graphs

✍ David D. Gebhard; Bruce E. Sagan 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 183 KB

Greene and Zaslavsky proved that the number of acyclic orientations of a graph G with a unique sink at a given vertex is, up to sign, the linear coefficient of the chromatic polynomial. We give three proofs of this result using pure induction, noncommutative symmetric functions, and an algorithmic b

Realization of digraphs by preferences b

Realization of digraphs by preferences based on distances in graphs

✍ Weizhen Gu; K. B. Reid; Walter Schnyder 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 321 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 orientation of meyniel graphs

✍ Mostaffa Blidia; Pierre Duchet; Frédéric Maffray 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 360 KB

## Abstract A kernel of a directed graph is a set of vertices __K__ that is both absorbant and independent (i.e., every vertex not in __K__ is the origin of an arc whose extremity is in __K__, and no arc of the graph has both endpoints in __K__). In 1983, Meyniel conjectured that any perfect graph,