𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Parity Theorem for Drawings of Complete and Complete Bipartite Graphs

✍ Scribed by Dan McQuillan and R. Bruce Richter

Book ID
120076168
Publisher
Mathematical Association of America
Year
2010
Tongue
English
Weight
174 KB
Volume
117
Category
Article
ISSN
0002-9890

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Book drawings of complete bipartite grap
Book drawings of complete bipartite graphs
✍ de Klerk, Etienne; Pasechnik, Dmitrii V.; Salazar, Gelasio πŸ“‚ Article πŸ“… 2014 πŸ› Elsevier Science 🌐 English βš– 755 KB
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
Rotation numers for complete bipartite g
Rotation numers for complete bipartite graphs
✍ Julie Haviland; Andrew Thomason πŸ“‚ Article πŸ“… 1992 πŸ› John Wiley and Sons 🌐 English βš– 510 KB

## Abstract A __rooted graph__ is a pair (__G, x__) where __G__ is a simple undirected graph and __x__ Ο΅ __V__(__G__). If __G__ if rooted at __x__, then its __rotation number h(G, x)__ is teh minimum number of edges in a graph __F__, of the same order as __G__, such that for all __v__ Ο΅ __V(F)__ we