EJC 2011 - PDF Preprint Papers

EJC 2011

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed EJC-2011 Paper

click to vote

EJC
2011

71views Information Technology» more EJC 2011»

Matching and edge-connectivity in regular graphs

1 years 9 days ago

Download www.math.uiuc.edu

Henning and Yeo proved a lower bound for the minimum size of a maximum matching in a connected k-regular graphs with n vertices; it is sharp inﬁnitely often. In an earlier paper...

Suil O, Douglas B. West

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Related Conferences

Id	Views	Title	Status
1	71	Matching and edge-connectivity in regular graphs	claim
2	66	Enumeration of connected Catalan objects by type	claim
3	56	Distributive lattices, polyhedra, and generalized flows	claim
4	55	Cubic time recognition of cocircuit graphs of uniform oriented matroids	claim
5	54	Modular elimination in matroids and oriented matroids	claim
6	53	Two enumerative results on cycles of permutations	claim
7	52	Bounds on generalized Frobenius numbers	claim
8	50	A Tutte-style proof of Brylawski's tensor product formula	claim
9	47	Lower bounds for Buchsbaum* complexes	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers