Partitioning the edges of a graph (Q1259608): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0095-8956(78)90004-7 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2067468322 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: 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 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Further remarks on partitioning the edges of a graph / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3115603 / rank | |||
Normal rank | |||
Latest revision as of 02:38, 13 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Partitioning the edges of a graph |
scientific article |
Statements
Partitioning the edges of a graph (English)
0 references
1978
0 references
colouring
0 references
edge partition graph
0 references
