𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Zeros of chromatic and flow polynomials of graphs

✍ Scribed by Bill Jackson

Book ID
113014296
Publisher
Springer
Year
2003
Tongue
English
Weight
124 KB
Volume
76
Category
Article
ISSN
0047-2468

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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(