On L<sub>2</sub>-Golourings of a Graph (Q3749077)
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 3985253
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On L<sub>2</sub>-Golourings of a Graph |
scientific article; zbMATH DE number 3985253 |
Statements
On L<sub>2</sub>-Golourings of a Graph (English)
0 references
1985
0 references
chromatic number
0 references
clique number
0 references
0.8029447197914124
0 references
0.763351321220398
0 references
0.7620676159858704
0 references
0.7609260678291321
0 references
0.7581598162651062
0 references
A graph G with 18 vertices is described such that the graph \(H=G^ 2\) obtained by joining vertices at distance at most 2 in G satisfies \(\chi\) (H)-\(\omega (H)=3\). Here \(\chi\) (H) is the chromatic number and \(\omega\) (H) the clique number of H. In fact the complement of H consists of three disjoint copies of \(C_ 5\) and three isolated vertices, and so \(\chi (H)=12\), \(\omega (H)=9\).
0 references