Colouring perfect graphs with bounded clique number (Q345123): 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 / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C17 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C70 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6656189 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
colouring algorithm | |||
| Property / zbMATH Keywords: colouring algorithm / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
perfect graph | |||
| Property / zbMATH Keywords: perfect graph / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
balanced skew partition | |||
| Property / zbMATH Keywords: balanced skew partition / rank | |||
Normal rank | |||
Revision as of 08:07, 28 June 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Colouring perfect graphs with bounded clique number |
scientific article |
Statements
Colouring perfect graphs with bounded clique number (English)
0 references
25 November 2016
0 references
colouring algorithm
0 references
perfect graph
0 references
balanced skew partition
0 references
