✦ LIBER ✦

Rotation numers for complete bipartite graphs

✍ Scribed by Julie Haviland; Andrew Thomason

Publisher: John Wiley and Sons
Year: 1992
Tongue: English
Weight: 510 KB
Volume: 16
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.3190160107

No coin nor oath required. For personal study only.

✦ Synopsis

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 can find a copy of G in F with the root x at v. Rotation numbers for complete bipartite graphs were itroduced in [4] by Cockayne and Lorimer. Several cases were evaluated by Bollobás and Cockayne in [2], and in this paper we give a full solution.

📜 SIMILAR VOLUMES

More rotation numbers for complete bipar

More rotation numbers for complete bipartite graphs

✍ Béla Bollobás; E. J. Cockayne 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 285 KB

## Abstract Let __G__ be a simple undirected graph which has __p__ vertices and is rooted at __x__. Informally, the __rotation number h(G, x)__ of this rooted graph is the minimum number of edges in a __p__ vertex graph __H__ such that for each vertex __v__ of __H__, there exists a copy of __G__ in

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

Topological Ramsey Theorem for Complete

Topological Ramsey Theorem for Complete Bipartite Graphs

✍ M.S. Miyauchi 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 645 KB

Pagenumber of complete bipartite graphs

✍ Douglas J. Muder; Margaret Lefevre Weaver; Douglas B. West 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 929 KB

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