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\).











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)