L(h, k)-coloring
Summary
In graph theory, a -labelling, -coloring or sometimes -coloring is a (proper) vertex coloring in which every pair of adjacent vertices has color numbers that differ by at least , and any nodes connected by a 2 length path have their colors differ by at least . The parameters are understood to be non-negative integers.
Further reading
- Wikipedia, page 47161006, revision 1327303244, L(h, k)-coloring. adopted
About this page
| Tag | Q7HMPXHEJK |
|---|---|
| URI | m2://Q7HMPXHEJK |
| Kind | concept |
| Writing | W1 stated |
| Same as | |
| Changed | 4 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W2
- edge defines in: at least one definition (0 of 1)
- edge instance_of in: at least two examples (0 of 2)
- edge not_instance_of in: at least one non-example (0 of 1)
- edge specializes both: the more general notions and the special cases (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.