All regular multigraphs of even order and high degree are 1-factorable.
Plantholt, Michael ; Tipnis, Shailesh K.
The Electronic Journal of Combinatorics [electronic only], Tome 8 (2001), / Harvested from The Electronic Library of Mathematics
Access to full text
Full (PDF)
Publié le : 2001-01-01
EUDML-ID : urn:eudml:doc:121634 
@article{01699539,
     title = {All regular multigraphs of even order and high degree are 1-factorable.},
     journal = {The Electronic Journal of Combinatorics [electronic only]},
     volume = {8},
     year = {2001},
     zbl = {0981.05079},
     language = {en},
     url = {http://dml.mathdoc.fr/item/01699539}
}

Plantholt, Michael; Tipnis, Shailesh K. All regular multigraphs of even order and high degree are 1-factorable.. The Electronic Journal of Combinatorics [electronic only], Tome 8 (2001) . http://gdmltest.u-ga.fr/item/01699539/