𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Maximum matching of given weight in complete and complete bipartite graphs

✍ Scribed by A. V. Karzanov

Publisher
Springer US
Year
1987
Tongue
English
Weight
641 KB
Volume
23
Category
Article
ISSN
1573-8337

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Hall parameters of complete and complete
Hall parameters of complete and complete bipartite graphs
✍ M. M. Cropper; A. J. W. Hilton πŸ“‚ Article πŸ“… 2002 πŸ› John Wiley and Sons 🌐 English βš– 287 KB

## Abstract Given a graph __G__, for each Ο… ∈__V__(__G__) let __L__(Ο…) be a list assignment to __G__. The well‐known choice number __c__(__G__) is the least integer __j__ such that if |__L__(Ο…)| β‰₯__j__ for all Ο… ∈__V__(__G__), then __G__ has a proper vertex colouring Ο• with Ο•(Ο…) ∈ __L__ (Ο…) (βˆ€Ο… ∈__

Pagenumber of complete bipartite graphs
Pagenumber of complete bipartite graphs
✍ Douglas J. Muder; Margaret Lefevre Weaver; Douglas B. West πŸ“‚ Article πŸ“… 1988 πŸ› John Wiley and Sons 🌐 English βš– 929 KB
Regular orientable embeddings of complet
Regular orientable embeddings of complete bipartite graphs
✍ Jin Ho Kwak; Young Soo Kwon πŸ“‚ Article πŸ“… 2005 πŸ› John Wiley and Sons 🌐 English βš– 199 KB

## Abstract In this paper, it will be shown that the isomorphism classes of regular orientable embeddings of the complete bipartite graph __K__~__n,n__~ are in one‐to‐one correspondence with the permutations on __n__ elements satisfying a given criterion, and the isomorphism classes of them are com