Skip to Main content Skip to Navigation
Journal articles

An improved linear bound on the number of perfect matchings in cubic graphs

Louis Esperet 1 Daniel Kral 2 Peter Skoda 3 Riste Skrekovski 4 
1 G-SCOP_OC - Optimisation Combinatoire
G-SCOP - Laboratoire des sciences pour la conception, l'optimisation et la production
2 ITI
3 SFU - Department of Mathematics [Burnaby]
4 FMF - Faculty of Mathematics and Physics [Ljubljana]
Document type :
Journal articles
Complete list of metadata
https://hal.inria.fr/inria-00528125
Contributor : Louis Esperet Connect in order to contact the contributor
Submitted on : Thursday, October 21, 2010 - 9:35:57 AM
Last modification on : Tuesday, September 21, 2021 - 10:58:24 AM

Links full text

arxiv

Identifiers

Collections

UGA | CNRS | G-SCOP | G-SCOP_OSP_OC | TDS-MACS

Citation

Louis Esperet, Daniel Kral, Peter Skoda, Riste Skrekovski. An improved linear bound on the number of perfect matchings in cubic graphs. European Journal of Combinatorics, Elsevier, 2010, 31 (5), pp.1316-1334. ⟨10.1016/j.ejc.2009.11.008⟩. ⟨inria-00528125⟩

Export

BibTeX TEI DC DCterms EndNote Datacite

Share

Metrics

Record views

66

 

Contact                    Legal Notice                    Personal Data