✦ LIBER ✦

The bichromaticity of cylinder graphs and torus graphs

✍ Scribed by Dan Pritikin

Publisher: John Wiley and Sons
Year: 1987
Tongue: English
Weight: 420 KB
Volume: 11
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.3190110114

No coin nor oath required. For personal study only.

✦ Synopsis

The bichromaticity of a bipartite graph B is defined as the maximum value of r + s for which B has the complete bipartite graph K,, as a homomorphic image We determine the bichromaticity of any bipartite cylinder graph C2,, x P, or torus graph CZn x C , , In the process, w e disprove a conjecture of Harary, Hsu, and Miller [Z]

📜 SIMILAR VOLUMES

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

Graphs on the Torus and Geometry of Numb

Graphs on the Torus and Geometry of Numbers

✍ A. Schrijver 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 424 KB

We show that if \(G\) is a graph embedded on the torus \(S\) and each nonnullhomotopic closed curve on \(S\) intersects \(G\) at least \(r\) times, then \(G\) contains at least \(\left\lfloor\frac{3}{4} r\right\rfloor\) pairwise disjoint nonnullhomotopic circuits. The factor \(\frac{3}{4}\) is best

A note on the bichromatic numbers of gra

A note on the bichromatic numbers of graphs

✍ Dennis D. A. Epple; Jing Huang 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 90 KB 👁 2 views

On some minimal graphs of the torus

✍ R. Bodendiek; K. Wagner 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 259 KB 👁 1 views

## Let be the set of finite, simple and nondirected graphs being not embeddable into the torus. Furthermore let >4 be a partial order-relation and M, (r) the minimal basis of I'. In this paper we determine three graphs of M, (r) being embeddable into the projective plane and containing the subgrap

Grid Minors of Graphs on the Torus

✍ M. Degraaf; A. Schrijver 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 197 KB

Constructing the Graphs That Triangulate

Constructing the Graphs That Triangulate Both the Torus and the Klein Bottle

✍ Serge Lawrencenko; Seiya Negami 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 158 KB

We show how to construct all the graphs that can be embedded on both the torus and the Klein bottle as their triangulations.