Maximum diameter of 3‐ and 4‐colorable graphs (Q6093149)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7746567
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Maximum diameter of 3‐ and 4‐colorable graphs |
scientific article; zbMATH DE number 7746567 |
Statements
Maximum diameter of 3‐ and 4‐colorable graphs (English)
0 references
6 October 2023
0 references
diameter
0 references
\(k\)-colorable
0 references
linear programming duality
0 references
minimum degree
0 references
0.856239378452301
0 references
0.8540598154067993
0 references
0.7869324684143066
0 references
0.782099723815918
0 references
0.7818664908409119
0 references
