Colouring the Edges of a Multigraph so that Each Vertex has at Most <i>j</i> , or at Least <i>j</i> , Edges of Each Colour on it (Q4099664)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3522007
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Colouring the Edges of a Multigraph so that Each Vertex has at Most <i>j</i> , or at Least <i>j</i> , Edges of Each Colour on it |
scientific article; zbMATH DE number 3522007 |
Statements
Colouring the Edges of a Multigraph so that Each Vertex has at Most <i>j</i> , or at Least <i>j</i> , Edges of Each Colour on it (English)
0 references
1975
0 references
