✦ LIBER ✦

Acyclic orientations and chromatic generating functions

✍ Scribed by Ira M. Gessel

Book ID: 108315577
Publisher: Elsevier Science
Year: 2001
Tongue: English
Weight: 121 KB
Volume: 232
Category: Article
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(00)00344-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Generating the Acyclic Orientations of a

Generating the Acyclic Orientations of a Graph

✍ Matthew B Squire 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 206 KB

The acyclic orientations of a graph are related to its chromatic polynomial, to its reliability, and to certain hyperplane arrangements. In this paper, an algorithm for listing the acyclic orientations of a graph is presented. The algorithm is shown to Ž . require O n time per acyclic orientation ge

Acyclic orientations of a graph and chro

Acyclic orientations of a graph and chromatic and independence numbers

✍ R.W Deming 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 614 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

Graphical Eulerian numbers and chromatic

Graphical Eulerian numbers and chromatic generating functions

✍ Ioan Tomescu 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 217 KB

In this paper some further properties of the coefficients of a chromatic generating function introduced by Linial are proved. A combinatorial interpretation of these numbers is given by specializing some results of Stanley on posets to surjective n-colorings of a graph G of order n compatible with l

A generalized chromatic polynomial, acyc

A generalized chromatic polynomial, acyclic orientations with prescribed sources and sinks, and network reliability

✍ J. Rodriguez; A. Satyanarayana 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 753 KB

Suppose G =(V, E) is a graph and K, K', K" are subsets of V such that K sK'nK". We introduce and study a polynomial P(G, K, K', K"; I.) in i. This polynomial coincides with the classical chromatic polynomial P(G; 1) when K = V. The results of this paper generalize Whitney's characterizations of the

Network reliability and acyclic orientat

Network reliability and acyclic orientations

✍ R. Johnson 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 934 KB