A note on coloring \((4K_1, C_4, C_6)\)-free graphs with a \(C_7\) (Q2674382)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A note on coloring \((4K_1, C_4, C_6)\)-free graphs with a \(C_7\) |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on coloring \((4K_1, C_4, C_6)\)-free graphs with a \(C_7\) |
scientific article |
Statements
A note on coloring \((4K_1, C_4, C_6)\)-free graphs with a \(C_7\) (English)
0 references
12 September 2022
0 references
graph coloring
0 references
neighborhood diversity
0 references
integer programming
0 references
0 references
