Maximum matchings in regular graphs of high girth.
Flaxman, Abraham D.; Hoory, Shlomo
The Electronic Journal of Combinatorics [electronic only] (2007)
- Volume: 14, Issue: 1, page Research paper N1, 4 p.-Research paper N1, 4 p.
- ISSN: 1077-8926
Access Full Article
top
How to cite
topFlaxman, Abraham D., and Hoory, Shlomo. "Maximum matchings in regular graphs of high girth.." The Electronic Journal of Combinatorics [electronic only] 14.1 (2007): Research paper N1, 4 p.-Research paper N1, 4 p.. <http://eudml.org/doc/127271>.
@article{Flaxman2007,
author = {Flaxman, Abraham D., Hoory, Shlomo},
journal = {The Electronic Journal of Combinatorics [electronic only]},
language = {eng},
number = {1},
pages = {Research paper N1, 4 p.-Research paper N1, 4 p.},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {Maximum matchings in regular graphs of high girth.},
url = {http://eudml.org/doc/127271},
volume = {14},
year = {2007},
}
TY - JOUR
AU - Flaxman, Abraham D.
AU - Hoory, Shlomo
TI - Maximum matchings in regular graphs of high girth.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 2007
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 14
IS - 1
SP - Research paper N1, 4 p.
EP - Research paper N1, 4 p.
LA - eng
UR - http://eudml.org/doc/127271
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.