Chromatic classes of 2-connected \((n,n+4)\)-graphs with at least four triangles. (Q1427480): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 18:51, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Chromatic classes of 2-connected \((n,n+4)\)-graphs with at least four triangles. |
scientific article |
Statements
Chromatic classes of 2-connected \((n,n+4)\)-graphs with at least four triangles. (English)
0 references
14 March 2004
0 references
Chromatic polynomial
0 references
Chromatically equivalent
0 references
Chromatically unique
0 references
