Maximum chromatic polynomials of 2‐connected graphs (Q4297818): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/jgt.3190180404 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1995418109 / rank | |||
Normal rank | |||
Latest revision as of 01:26, 20 March 2024
scientific article; zbMATH DE number 599617
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Maximum chromatic polynomials of 2‐connected graphs |
scientific article; zbMATH DE number 599617 |
Statements
Maximum chromatic polynomials of 2‐connected graphs (English)
0 references
20 March 1995
0 references
2-connected graphs
0 references
chromatic polynomial
0 references
extremal graphs
0 references
cycles
0 references
