L(2,1)-coloring
http://dbpedia.org/resource/L(2,1)-coloring an entity of type: SupremeCourtOfTheUnitedStatesCase
L(2, 1)-coloring 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.
rdf:langString
rdf:langString
L(2,1)-coloring
xsd:integer
47620324
xsd:integer
1039349257
rdf:langString
L(2, 1)-coloring 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.
xsd:nonNegativeInteger
882
