Regular Multigraphs of High Degree are 1-Factorizable (Q4009246): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1112/jlms/s2-44.3.393 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2085379850 / rank | |||
Normal rank | |||
Latest revision as of 18:50, 19 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
