A relaxation of Havel's 3-color problem (Q963412): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ipl.2008.02.003 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2062686295 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Some counterexamples associated with the three-color problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4865526 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Bordeaux 3-color conjecture and 3-choosability / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: 3-list-coloring planar graphs of girth 5 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A not 3-choosable planar graph without 3-cycles / rank | |||
Normal rank | |||
Latest revision as of 17:32, 2 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A relaxation of Havel's 3-color problem |
scientific article |
Statements
A relaxation of Havel's 3-color problem (English)
0 references
19 April 2010
0 references
combinatorial problems
0 references
graph algorithms
0 references
cycle distance
0 references
3-choosability
0 references
