An improved linear bound on the number of perfect matchings in cubic graphs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles European Journal of Combinatorics Year : 2010

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

Dates and versions

inria-00528125 , version 1 (21-10-2010)

Identifiers

Cite

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, 2010, 31 (5), pp.1316-1334. ⟨10.1016/j.ejc.2009.11.008⟩. ⟨inria-00528125⟩
66 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More