All regular multigraphs of even order and high degree are 1-factorable.
Plantholt, Michael; Tipnis, Shailesh K.
The Electronic Journal of Combinatorics [electronic only] (2001)
- Volume: 8, Issue: 1, page Research paper R41, 8 p.-Research paper R41, 8 p.
- ISSN: 1077-8926
Access Full Article
top
How to cite
topPlantholt, Michael, and Tipnis, Shailesh K.. "All regular multigraphs of even order and high degree are 1-factorable.." The Electronic Journal of Combinatorics [electronic only] 8.1 (2001): Research paper R41, 8 p.-Research paper R41, 8 p.. <http://eudml.org/doc/121634>.
@article{Plantholt2001,
author = {Plantholt, Michael, Tipnis, Shailesh K.},
journal = {The Electronic Journal of Combinatorics [electronic only]},
keywords = {regular multigraph; one-factorization conjecture},
language = {eng},
number = {1},
pages = {Research paper R41, 8 p.-Research paper R41, 8 p.},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {All regular multigraphs of even order and high degree are 1-factorable.},
url = {http://eudml.org/doc/121634},
volume = {8},
year = {2001},
}
TY - JOUR
AU - Plantholt, Michael
AU - Tipnis, Shailesh K.
TI - All regular multigraphs of even order and high degree are 1-factorable.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 2001
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 8
IS - 1
SP - Research paper R41, 8 p.
EP - Research paper R41, 8 p.
LA - eng
KW - regular multigraph; one-factorization conjecture
UR - http://eudml.org/doc/121634
ER -
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.