✦ LIBER ✦

Embeddings of bipartite graphs

✍ Scribed by Mohammed Abu-Sbeih; T. D. Parsons

Publisher: John Wiley and Sons
Year: 1983
Tongue: English
Weight: 458 KB
Volume: 7
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.3190070305

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

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

Bichromaticity of bipartite graphs

✍ Dan Pritikin 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 312 KB

Let 8 be a bipartite graph with edge set €and vertex bipartition M, N. The bichromaticity p ( 6) is defined as the maximum number p such that a complete bipartite graph on p vertices is obtainable from 5 by a sequence of identifications of vertices of M or vertices of N. Let p = max{lMI, IN\}. Hara

Koszul Bipartite Graphs

✍ Hidefumi Ohsugi; Takayuki Hibi 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 48 KB

Cellular Bipartite Graphs

✍ Hans-Jürgen Bandelt; Victor Chepoi 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 310 KB