Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

99

Voted

EJC
2010

119views Information Technology» more EJC 2010»

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

15 years 2 months ago

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

Download www.fmf.uni-lj.si

Louis Esperet, Daniel Král', Petr Skoda, Ri

Real-time Traffic

EJC 2007 | EJC 2010 |

claim paper

Related Content

» The Polynomially Bounded Perfect Matching Problem Is in NC 2

» Bounds on the maximum multiplicity of some common geometric graphs

» An improved constanttime approximation algorithm for maximummatchings

» On linear and semidefinite programming relaxations for hypergraph matching

» Network Game with Attacker and Protector Entities

» Maximum Bipartite Matching Size And Application to Cuckoo Hashing

» Optimal Partial Tiling of Manhattan Polyominoes

» Untangling Tanglegrams Comparing Trees by Their Drawings

Post Info
More Details (n/a)

Added	10 Dec 2010
Updated	10 Dec 2010
Type	Journal
Year	2010
Where	EJC
Authors	Louis Esperet, Daniel Král', Petr Skoda, Riste Skrekovski

Comments (0)