{
  "aliases": null,
  "backlinks": null,
  "body": "\n## Summary\n\nIn 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]].\n",
  "commit": "68a8c3dc73fd55004b2796431c607c30960d1a85",
  "front": {
    "inventory": [
      "TWNPTSB5H2"
    ],
    "kind": "concept",
    "name": "L(h, k)-coloring",
    "same_as": {
      "wikidata": "Q25345905",
      "wikipedia": "L(h, k)-coloring"
    },
    "sources": [
      {
        "locator": "L(h, k)-coloring",
        "mention": "wikipedia://en/47161006",
        "note": "adopted",
        "sections": [
          "Summary"
        ],
        "wikipedia": "en:47161006@r1327303244"
      }
    ],
    "tag": "Q7HMPXHEJK"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/Q7HMPXHEJK/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/Q7HMPXHEJK.md",
  "msc": null,
  "name": "L(h, k)-coloring",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/Q7H/Q7HMPXHEJK.md",
  "status": null,
  "tag": "Q7HMPXHEJK",
  "uri": "m2://Q7HMPXHEJK",
  "url": "https://math2.tamnd.com/wiki/l-h-k-coloring/",
  "writing": {
    "tag": "Q7HMPXHEJK",
    "kind": "concept",
    "level": "W1",
    "next": [
      {
        "what": "edge defines in",
        "note": "at least one definition",
        "have": 0,
        "want": 1
      },
      {
        "what": "edge instance_of in",
        "note": "at least two examples",
        "have": 0,
        "want": 2
      },
      {
        "what": "edge not_instance_of in",
        "note": "at least one non-example",
        "have": 0,
        "want": 1
      },
      {
        "what": "edge specializes both",
        "note": "the more general notions and the special cases",
        "have": 0,
        "want": 1
      }
    ]
  }
}