Some perfect coloring properties of graphs (Q1136777): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: A Construction of Graphs without Triangles having Pre-Assigned Order and Chromatic Number / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5572939 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5578801 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On a property of the class of n-colorable graphs / rank | |||
Normal rank | |||
Latest revision as of 04:17, 13 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Some perfect coloring properties of graphs |
scientific article |
Statements
Some perfect coloring properties of graphs (English)
0 references
1979
0 references
Grundy coloring
0 references
Grundy number
0 references
chromatic number
0 references
maximum clique size
0 references
achromatic number
0 references
infinite graphs
0 references
denumerable graphs
0 references
locally finite graphs
0 references
0 references
