Tight bounds for the \(N_2\)-chromatic number of graphs (Q6563257)
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: Tight bounds for the Nā-chromatic number of graphs |
scientific article; zbMATH DE number 7872523
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Tight bounds for the \(N_2\)-chromatic number of graphs |
scientific article; zbMATH DE number 7872523 |
Statements
Tight bounds for the \(N_2\)-chromatic number of graphs (English)
0 references
27 June 2024
0 references
vertex coloring
0 references
\(N_2\)-vertex coloring
0 references
\(N_2\)-chromatic number
0 references
maximum degree
0 references
diameter
0 references
0.8952772617340088
0 references
0.781456708908081
0 references
0.7807257175445557
0 references
0.7789749503135681
0 references
0.7708314061164856
0 references
