On ?-equivalence and ?-equivalence of graphs (Q4865534)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 845489
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On ?-equivalence and ?-equivalence of graphs |
scientific article; zbMATH DE number 845489 |
Statements
25 February 1996
0 references
chromatic polynomial
0 references
\(\sigma\)-polynomial
0 references
\(\sigma\)-equivalence
0 references
\(\sigma\)-uniqueness
0 references
On ?-equivalence and ?-equivalence of graphs (English)
0 references
0.8521537184715271
0 references
0.8517351746559143
0 references
0.8395017385482788
0 references
0.8296707272529602
0 references
0.8273826837539673
0 references
