An upper bound on the chromatic number of a circle graph without \(K_4\) (Q1930220): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 16:21, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An upper bound on the chromatic number of a circle graph without \(K_4\) |
scientific article |
Statements
An upper bound on the chromatic number of a circle graph without \(K_4\) (English)
0 references
10 January 2013
0 references
coloring of chords
0 references
