Unique Sink Orientations of Grids
✍ Scribed by Bernd Gärtner; Walter D. Jr. Morris; Leo Rüst
- Publisher
- Springer
- Year
- 2007
- Tongue
- English
- Weight
- 693 KB
- Volume
- 51
- Category
- Article
- ISSN
- 0178-4617
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
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
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)