An upper bound on the chromatic number of a circle graph without \(K_4\) (Q1930220): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1212.3983 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A triangle-free circle graph with chromatic number 5 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Covering and coloring polygon-circle graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Every circle graph of girth at least 5 is 3-colourable / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4657585 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Coloring circle graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Coloring Clean and K 4-Free Circle Graphs / rank | |||
Normal rank | |||
Latest revision as of 02:37, 6 July 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
