𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Chromatic and Flow Polynomials for Directed Graphs

✍ Scribed by D.K Arrowsmith; J.W Essam

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
557 KB
Volume
62
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Chromatic polynomials, polygon trees, an
Chromatic polynomials, polygon trees, and outerplanar graphs
✍ C. D. Wakelin; D. R. Woodall 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 370 KB

## Abstract It is proved that all classes of polygon trees are characterized by their chromatic polynomials, and a characterization is given of those polynominals that are chromatic polynomials of outerplanar graphs. The first result yields an alternative proof that outerplanar graphs are recogniza

Maximal chromatic polynomials of connect
Maximal chromatic polynomials of connected planar graphs
✍ Ioan Tomescu 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 429 KB 👁 1 views

## Abstract In this paper we obtain chromatic polynomials of connected 3‐ and 4‐chromatic planar graphs that are maximal for positive integer‐valued arguments. We also characterize the class of connected 3‐chromatic graphs having the maximum number of __p__‐colorings for __p__ ≥ 3, thus extending a

Maximum chromatic polynomials of 2-conne
Maximum chromatic polynomials of 2-connected graphs
✍ Ioan Tomescu 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 345 KB 👁 1 views

## Abstract In this paper we obtain chromatic polynomials __P(G__; λ) of 2‐connected graphs of order __n__ that are maximum for positive integer‐valued arguments λ ≧ 3. The extremal graphs are cycles __C__~__n__~ and these graphs are unique for every λ ≧ 3 and __n__ ≠ 5. We also determine max{__P(

Walks on Directed Graphs and Matrix Poly
Walks on Directed Graphs and Matrix Polynomials
✍ Miguel A. Méndez 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 166 KB

We give a matrix generalization of the family of exponential polynomials in one variable , k (x). Our generalization consists of a matrix of polynomials 8 k (X)= (8 (k) i, j (X)) n i, j=1 depending on a matrix of variables X=(x i, j ) n i, j=1 . We prove some identities of the matrix exponential pol

Maximal σ-polynomials of connected 3-chr
Maximal σ-polynomials of connected 3-chromatic graphs
✍ Ioan Tomescu 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 113 KB 👁 1 views

## Abstract In the set of graphs of order __n__ and chromatic number __k__ the following partial order relation is defined. One says that a graph __G__ is less than a graph __H__ if __c__~__i__~(__G__) ≤ __c__~__i__~(__H__) holds for every __i__, __k__ ≤ __i__ ≤ __n__ and at least one inequality is