---
tag: Q7HMPXHEJK
kind: concept
name: L(h, k)-coloring
sources:
  - wikipedia: en:47161006@r1327303244
    locator: L(h, k)-coloring
    note: adopted
    mention: wikipedia://en/47161006
    sections: [Summary]
same_as:
  wikidata: Q25345905
  wikipedia: L(h, k)-coloring
inventory: [TWNPTSB5H2]
---

## Summary

In graph theory, a **$L(h, k)$-labelling**, **$L(h, k)$-coloring** or sometimes **$L(p, q)$-coloring** is a [[(proper) vertex coloring|0NCPXH194Y]] in which every pair of adjacent vertices has color numbers that differ by at least $h$, and any nodes connected by a 2 length path have their colors differ by at least $k$. The parameters $h, k$ are understood to be non-negative [[integers|0C4JS9RF5M]].