Chromatic classes of 2-connected \((n,n+4)\)-graphs with three triangles and one induced 4-cycle (Q1025926): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q545569 |
Changed an Item |
||
| Property / author | |||
| Property / author: Yee-Hock Peng / rank | |||
Normal rank | |||
Revision as of 21:41, 15 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Chromatic classes of 2-connected \((n,n+4)\)-graphs with three triangles and one induced 4-cycle |
scientific article |
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
