Regular Multigraphs of High Degree are 1-Factorizable (Q4009246): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 13:49, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Regular Multigraphs of High Degree are 1-Factorizable |
scientific article |
Statements
Regular Multigraphs of High Degree are 1-Factorizable (English)
0 references
27 September 1992
0 references
1-factorizable
0 references
chromatic index
0 references
regular graph
0 references
multigraph
0 references
multiplicity
0 references
conjecture by Goldberg
0 references
