An edge-coloration theorem for bipartite graphs with applications (Q1248526): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3941433 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5611635 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On decompositions of a multi-graph into spanning subgraphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Subgraphs with prescribed valencies / rank | |||
Normal rank | |||
Latest revision as of 23:58, 12 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An edge-coloration theorem for bipartite graphs with applications |
scientific article |
Statements
An edge-coloration theorem for bipartite graphs with applications (English)
0 references
1978
0 references
