Chromatic classes of 2-connected \((n,n+4)\)-graphs with three triangles and one induced 4-cycle (Q1025926)
From MaRDI portal
!
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 5569054
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Chromatic classes of 2-connected \((n,n+4)\)-graphs with three triangles and one induced 4-cycle |
scientific article; zbMATH DE number 5569054 |
Statements
Chromatic classes of 2-connected \((n,n+4)\)-graphs with three triangles and one induced 4-cycle (English)
0 references
23 June 2009
0 references
chromatic polynomial
0 references
chromatically unique graph
0 references
chromatically equivalent graph
0 references
relative-closed
0 references
0.9869354963302612
0 references
0.9716667532920836
0 references
0.9326092004776
0 references
0.8700815439224243
0 references
