Upper bounds for the achromatic and coloring numbers of a graph (Q516843): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05C15 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6695045 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
chromatic number | |||
Property / zbMATH Keywords: chromatic number / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
coloring number | |||
Property / zbMATH Keywords: coloring number / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
achromatic number | |||
Property / zbMATH Keywords: achromatic number / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
Randić index | |||
Property / zbMATH Keywords: Randić index / rank | |||
Normal rank |
Revision as of 04:21, 1 July 2023
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Upper bounds for the achromatic and coloring numbers of a graph |
scientific article |
Statements
Upper bounds for the achromatic and coloring numbers of a graph (English)
0 references
15 March 2017
0 references
chromatic number
0 references
coloring number
0 references
achromatic number
0 references
Randić index
0 references