✦ LIBER ✦

A remark on embedded bipartite graphs

✍ Scribed by Gadi Moran

Publisher: Elsevier Science
Year: 1987
Tongue: English
Weight: 116 KB
Volume: 43
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(87)90023-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Embeddings of bipartite graphs

✍ Mohammed Abu-Sbeih; T. D. Parsons 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 458 KB

Quadrilateral embeddings of bipartite gr

Quadrilateral embeddings of bipartite graphs

✍ Ian Anderson 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 304 KB

## Abstract Current graphs and a theorem of White are used to show the existence of almost complete regular bipartite graphs with quadrilateral embeddings conjectured by Pisanski. Decompositions of __K~n~__ and __K~n, n~__ into graphs with quadrilateral embeddings are discussed, and some thickness

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

Self-dual embeddings of complete biparti

Self-dual embeddings of complete bipartite graphs

✍ Dan Archdeacon; Nora Hartsfield 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 439 KB

Embeddings of cartesian products of near

Embeddings of cartesian products of nearly bipartite graphs

✍ Bojan Mohar; Tomaž Pisanski; Arthur T. White 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 384 KB

## Abstract Surgical techniques are often effective in constructing genus embeddings of cartesian products of bipartite graphs. In this paper we present a general construction that is “close” to a genus embedding for cartesian products, where each factor is “close” to being bipartite. In specializi

On bipartite tetravalent graphs

✍ D.H. Smith 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 560 KB

In [ IO, 1 I 1 all non-bipartite distance-transitive graphs of vallency four have been determined. e use a result of Gardinrzr [ 4 ] to enable us to determine thf: bipar ite distance-transitive graphs of valency four. We wx tht definitio s and notation o H wish to exp C'ollege, withou ould not have