𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Biased Expansions of Biased Graphs and Their Chromatic Polynomials

✍ Scribed by Lori Koban

Book ID
120770371
Publisher
Springer
Year
2012
Tongue
English
Weight
239 KB
Volume
16
Category
Article
ISSN
0218-0006

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Chromatic Polynomials And Chromaticity O
Chromatic Polynomials And Chromaticity Of Graphs
✍ F. M. Dong πŸ“‚ Library πŸ“… 2005 πŸ› World Scientific 🌐 English βš– 9 MB

This is the first book to comprehensively cover chromatic polynomials of graphs. It includes most of the known results and unsolved problems in the area of chromatic polynomials. Dividing the book into three main parts, the authors take readers from the rudiments of chromatic polynomials to more com

Chromatic Polynomials and Chromaticity o
Chromatic Polynomials and Chromaticity of Graphs || FRONT MATTER
✍ Dong, F M; Koh, K M; Teo, K L πŸ“‚ Article πŸ“… 2005 πŸ› WORLD SCIENTIFIC 🌐 English βš– 905 KB

This is the first book to comprehensively cover chromatic polynomials of graphs. It includes most of the known results and unsolved problems in the area of chromatic polynomials. Dividing the book into three main parts, the authors take readers from the rudiments of chromatic polynomials to more com

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(