L(h, k)-coloring
id:
l-h-k-coloring-293-3126079
title:
L(h, k)-coloring
text:
In graph theory, a L(h, k)-labelling, L(h, k)-coloring or sometimes L(p, q)-coloring is a (proper) vertex coloring 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 and k are understood to be non-negative integers. The problem originated from a channel assignment problem in radio networks. The span of an L(h, k)-labelling, ρh,k(G) is the difference between the
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/L(h,_k)-coloring
date created:
date modified:
2023-08-11T18:07:26Z
main entity:
{"identifier":"Q25345905","url":"https://www.wikidata.org/entity/Q25345905"}
image:
fields total:
13
integrity:
13