Chromatic classes of 2-connected \((n,n+4)\)-graphs with at least four triangles. (Q1427480): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.disc.2003.05.003 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2983506641 / rank | |||
Normal rank |
Revision as of 19:11, 19 March 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