Geodesic
A bound on the number of perfect matchings in Klee-graphs
Discrete mathematics & theoretical computer science, Tome 15 (2013) no. 1.

Voir la notice de l'article provenant de la source Episciences

Combinatorics 
@article{DMTCS_2013_15_1_a10,
     author = {Cygan, Marek and Pilipczuk, Marcin and \v{S}krekovski, Riste},
     title = {A bound on the number of perfect matchings in {Klee-graphs}},
     journal = {Discrete mathematics & theoretical computer science},
     publisher = {mathdoc},
     volume = {15},
     number = {1},
     year = {2013},
     doi = {10.46298/dmtcs.633},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.633/}
}
TY  - JOUR
AU  - Cygan, Marek
AU  - Pilipczuk, Marcin
AU  - Škrekovski, Riste
TI  - A bound on the number of perfect matchings in Klee-graphs
JO  - Discrete mathematics & theoretical computer science
PY  - 2013
VL  - 15
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.633/
DO  - 10.46298/dmtcs.633
LA  - en
ID  - DMTCS_2013_15_1_a10
ER  - 
%0 Journal Article
%A Cygan, Marek
%A Pilipczuk, Marcin
%A Škrekovski, Riste
%T A bound on the number of perfect matchings in Klee-graphs
%J Discrete mathematics & theoretical computer science
%D 2013
%V 15
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.633/
%R 10.46298/dmtcs.633
%G en
%F DMTCS_2013_15_1_a10
Cygan, Marek; Pilipczuk, Marcin; Škrekovski, Riste. A bound on the number of perfect matchings in Klee-graphs. Discrete mathematics & theoretical computer science, Tome 15 (2013) no. 1. doi : 10.46298/dmtcs.633. http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.633/

Cité par Sources :