The factorization theorem of adjoint polynomials of a kind of graph and chromatically equivalence of its complement (Q3513801)
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: The factorization theorem of adjoint polynomials of a kind of graph and chromatically equivalence of its complement |
scientific article; zbMATH DE number 5308261
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The factorization theorem of adjoint polynomials of a kind of graph and chromatically equivalence of its complement |
scientific article; zbMATH DE number 5308261 |
Statements
6 August 2008
0 references
chromatic polynomial
0 references
adjoint polynomial
0 references
factorization
0 references
chromatically equivalent graph
0 references
chromatically non-uniqueness
0 references
0.9608120918273926
0 references
0.9283791184425354
0 references
0.9230820536613464
0 references
0.9216895699501038
0 references
