Some new bounds for the maximum number of vertex colorings of a (v,e)-graph (Q4242963)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Some new bounds for the maximum number of vertex colorings of a (v,e)-graph |
scientific article; zbMATH DE number 1286514
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Some new bounds for the maximum number of vertex colorings of a (v,e)-graph |
scientific article; zbMATH DE number 1286514 |
Statements
30 January 2000
0 references
vertex colorings
0 references
chromatic polynomial
0 references
pseudo-proper colorings
0 references
Some new bounds for the maximum number of vertex colorings of a (v,e)-graph (English)
0 references
0.94726646
0 references
0.9047803
0 references
0.9032693
0 references
0 references
0 references
0.8905885
0 references
0 references
