𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The number of well-oriented regions

✍ Scribed by Zoltán Füredi

Book ID
104641762
Publisher
Springer
Year
1982
Tongue
English
Weight
144 KB
Volume
12
Category
Article
ISSN
0046-5755

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The chromatic number of oriented graphs
The chromatic number of oriented graphs
✍ Sopena, Eric 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 198 KB 👁 2 views

We introduce in this paper the notion of the chromatic number of an oriented graph G (that is of an antisymmetric directed graph) defined as the minimum order of an oriented graph H such that G admits a homomorphism to H. We study the chromatic number of oriented k-trees and of oriented graphs with

On the oriented chromatic number of grid
On the oriented chromatic number of grids
✍ Guillaume Fertin; André Raspaud; Arup Roychowdhury 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 111 KB

In this paper, we focus on the oriented coloring of graphs. Oriented coloring is a coloring of the vertices of an oriented graph G without symmetric arcs such that (i) no two neighbors in G are assigned the same color, and (ii) if two vertices u and v such that (u, v) ∈ A(G) are assigned colors c(u)

The Geodetic Number of an Oriented Graph
The Geodetic Number of an Oriented Graph
✍ Gary Chartrand; Ping Zhang 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 149 KB

For two vertices u and v of an oriented graph D, the set I (u, v) consists of all vertices lying on a uv geodesic or vu geodesic in D. If S is a set of vertices of D, then I (S) is the union of all sets I (u, v) for vertices u and v in S. The geodetic number g(D) is the minimum cardinality among the