Chromatic classes of 2-connected \((n,n+4)\)-graphs with three triangles and one induced 4-cycle (Q1025926): 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.2008.08.016 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2050825359 / rank | |||
Normal rank | |||
Revision as of 02:11, 20 March 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
