An improved linear bound on the number of perfect matchings in cubic graphs, 47(2009)

An improved linear bound on the number of perfect matchings in cubic graphs, 47(2009)

Avtor: Louis Esperet, Daniel Král', Petr Škoda, Riste Škrekovski

Več o projektu...

IMFM preprints

Louis Esperet, Daniel Král', Petr Škoda, Riste Škrekovski: An improved linear bound on the number of perfect matchings in cubic graphs, 47(2009), 47 (2009)

MegaZine3 requires FlashPlayer 9

Get Adobe Flash player

Powered by MegaZine3

Išči
0%
0%