Graph colorings and the axiom of choice (Q1183089): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q5181374 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Equivalents of the axiom of choice. 2nd ed / rank | |||
Normal rank | |||
Revision as of 14:38, 15 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Graph colorings and the axiom of choice |
scientific article |
Statements
Graph colorings and the axiom of choice (English)
0 references
28 June 1992
0 references
There is shown that the axiom of choice is equivalent to each of the following two statements: the chromatic number exists for every graph; every graph has an irreducible good colourings.
0 references
graph colorings
0 references
axiom of choice
0 references
chromatic number
0 references
irreducible good colourings
0 references
