On the number of perfect matchings and Hamilton cycles in -regular non-bipartite graphs.
The Electronic Journal of Combinatorics [electronic only] (2000)
- Volume: 7, Issue: 1, page Research paper R57, 11 p.-Research paper R57, 11 p.
- ISSN: 1077-8926
Access Full Article
topHow to cite
topFrieze, Alan. "On the number of perfect matchings and Hamilton cycles in -regular non-bipartite graphs.." The Electronic Journal of Combinatorics [electronic only] 7.1 (2000): Research paper R57, 11 p.-Research paper R57, 11 p.. <http://eudml.org/doc/121049>.
@article{Frieze2000,
author = {Frieze, Alan},
journal = {The Electronic Journal of Combinatorics [electronic only]},
keywords = {perfect matchings; Hamilton cycles},
language = {eng},
number = {1},
pages = {Research paper R57, 11 p.-Research paper R57, 11 p.},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {On the number of perfect matchings and Hamilton cycles in -regular non-bipartite graphs.},
url = {http://eudml.org/doc/121049},
volume = {7},
year = {2000},
}
TY - JOUR
AU - Frieze, Alan
TI - On the number of perfect matchings and Hamilton cycles in -regular non-bipartite graphs.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 2000
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 7
IS - 1
SP - Research paper R57, 11 p.
EP - Research paper R57, 11 p.
LA - eng
KW - perfect matchings; Hamilton cycles
UR - http://eudml.org/doc/121049
ER -
NotesEmbed ?
topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.