Combinatorics Coloring Concept
Edge colouring
Summary
An edge colouring assigns colours to the edges of a graph so that edges with a common end get different colours. It splits the edges into matchings and models scheduling problems. The node edge colouring gives the precise definition.
Further reading
- Web https://en.wikipedia.org/wiki/Edge_coloring, Definitions
About this page
| Tag | 0B5WCC02AN |
|---|---|
| URI | m2://0B5WCC02AN |
| Kind | concept |
| Writing | W1 stated |
| MSC | 05C15 |
| Same as |
Markdown · JSON · Edit on GitHub
What this page needs for W2
- 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.