Skip to Main content Skip to Navigation
Journal articles

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

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

Identifiers

Collections

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⟩

Share

Metrics

Record views

66