Maximal σ‐polynomials of connected 3‐chromatic graphs (Q4416305): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 03:45, 7 February 2024
scientific article; zbMATH DE number 1958316
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Maximal σ‐polynomials of connected 3‐chromatic graphs |
scientific article; zbMATH DE number 1958316 |
Statements
Maximal σ‐polynomials of connected 3‐chromatic graphs (English)
0 references
31 July 2003
0 references
unlabeled graph
0 references
chromatic polynomial
0 references
\(\sigma\)-polynomial
0 references
connected 3-chromatic graph
0 references
Stirling number of the second kind
0 references
bicyclic graph
0 references
poset
0 references
diagram of a poset
0 references
maximal number of 3-color partitions
0 references
