✦ LIBER ✦

Pagenumber of complete bipartite graphs

✍ Scribed by Douglas J. Muder; Margaret Lefevre Weaver; Douglas B. West

Publisher: John Wiley and Sons
Year: 1988
Tongue: English
Weight: 929 KB
Volume: 12
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.3190120403

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the Pagenumber of Complete Bipartite

On the Pagenumber of Complete Bipartite Graphs

✍ Hikoe Enomoto; Tomoki Nakamigawa; Katsuhiro Ota 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 324 KB

The pagenumber p(G) of a graph G is defined as the smallest n such that G can be embedded in a book with n pages. We give an upper bound for the pagenumber of the complete bipartite graph K m, n . Among other things, we prove p(K n, n ) w2nÂ3x+1 and p(K wn 2 Â4x, n ) n&1. We also give an asymptotic

Packing two bipartite graphs into a comp

Packing two bipartite graphs into a complete bipartite graph

✍ Wang, Hong 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 131 KB 👁 3 views

For two integers a and b, we say that a bipartite graph G admits an (a, b)bipartition if G has a bipartition (X, Y ) such that |X| = a and |Y | = b. We say that two bipartite graphs G and H are compatible if, for some integers a and b, both G and H admit (a, b)-bipartitions. In this paper, we prove

Acyclic orientations of complete biparti

Acyclic orientations of complete bipartite graphs

✍ Douglas B. West 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 216 KB

For a complete bipartite graph, the number of dependent edges in an acyclic orientation can be any integer from n-1 to e, where n and e are the number of vertices and edges in the graph. ## Ke3,words: Bipartite graph; Acyclic orientation Ill combinatorics we often ask whether an integer parameter

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__ (υ) (∀υ ∈__

P3-Factorization of complete bipartite g

P3-Factorization of complete bipartite graphs

✍ Kazuhiko Ushio 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 344 KB

P,-factorization of K,,,, is (i) m + n -0 (mod 3), (ii) m < 2n, (iii) n s 2m and (iv) 3mn/2(m + n) is an integer.

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