Recursive coloration of countable graphs (Q595648): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Effective coloration / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4128521 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5782525 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Π<sub>1</sub><sup>0</sup> classes and Boolean combinations of recursively enumerable sets / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Nonrecursive tilings of the plane. II / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On a system of axioms which has no recursively enumerable arithmetic model / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5573961 / rank | |||
Normal rank |
Latest revision as of 11:15, 14 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Recursive coloration of countable graphs |
scientific article |
Statements
Recursive coloration of countable graphs (English)
0 references
1983
0 references
recursive combinatorics
0 references
recursive graph
0 references
extensible coloring algorithm
0 references
countably infinite graphs
0 references
trial and error colorings
0 references
effective version of the theorem of Brooks
0 references
cellular spaces
0 references
0 references