L(2,1)-coloring
id:
l-2-1-coloring-289-10723789
title:
L(2,1)-coloring
text:
L(2, 1)-coloring or L(2,1)-labeling is a particular case of L(h, k)-coloring. In an L(2, 1)-coloring of a graph, G, the vertices of G are assigned color numbers in such a way that adjacent vertices get labels that differ by at least two, and the vertices that are at a distance of two from each other get labels that differ by at least one. An L(2,1)-coloring is a proper coloring, since adjacent vertices are assigned distinct colors. However, rather than counting the number of distinct colors used
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/L(2,1)-coloring
date created:
date modified:
2024-04-24T23:40:03Z
main entity:
{"identifier":"Q25351778","url":"https://www.wikidata.org/entity/Q25351778"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/0/06/L%282%2C1%29-coloring_of_C6.svg","width":786,"height":665}
fields total:
13
integrity:
14