Bounding \(\chi \) in terms of \(\omega \) and \(\varDelta \) for some classes of graphs (Q536214): 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: 5888515 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
vertex coloring | |||
| Property / zbMATH Keywords: vertex coloring / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
chromatic number | |||
| Property / zbMATH Keywords: chromatic number / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
clique number | |||
| Property / zbMATH Keywords: clique number / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
maximum degree | |||
| Property / zbMATH Keywords: maximum degree / rank | |||
Normal rank | |||
Revision as of 10:06, 1 July 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Bounding \(\chi \) in terms of \(\omega \) and \(\varDelta \) for some classes of graphs |
scientific article |
Statements
Bounding \(\chi \) in terms of \(\omega \) and \(\varDelta \) for some classes of graphs (English)
0 references
16 May 2011
0 references
vertex coloring
0 references
chromatic number
0 references
clique number
0 references
maximum degree
0 references
