On L2-Golourings of a Graph
From MaRDI portal
Publication:3749077
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\).
Recommendations
Cited in
(9)- On the parameter \(v_ 2(h)\) for \(L_ 2\)-coloured graphs
- On small graphs with highly imperfect powers
- On the coloured graph structure of Lusztig's canonical basis
- \(F\)-WORM colorings: results for 2-connected graphs
- Solutions of some L(2, 1)-coloring related open problems
- L(1,2)-coloring matrogenic graphs (extended abstract)
- scientific article; zbMATH DE number 1159270 (Why is no real title available?)
- A Frameless 2-Coloring of the Plane Lattice
- Guest editorial: Special issue in honor of Scott A. Vanstone
This page was built for publication: On L2-Golourings of a Graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3749077)