✦ LIBER ✦

Grid Minors of Graphs on the Torus

✍ Scribed by M. Degraaf; A. Schrijver

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 197 KB
Volume: 61
Category: Article
ISSN: 0095-8956
DOI: 10.1006/jctb.1994.1029

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

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

The bichromaticity of cylinder graphs an

The bichromaticity of cylinder graphs and torus graphs

✍ Dan Pritikin 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 420 KB

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

On minors of graphs with at least 3n −4

On minors of graphs with at least 3n −4 edges

✍ M. Khalifat; Themistocles Politof; A. Satyanarayana 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 390 KB 👁 1 views

## Abstract A point disconnecting set __S__ of a graph __G__ is a nontrivial __m__‐separator, where __m__ = |__S__|, if the connected components of __G__ ‐ __S__ can be partitioned into two subgraphs, each of which has at least two points. A 3‐connected graph is quasi 4‐connected if it has no nontr

Disjoint Cycles in Directed Graphs on th

Disjoint Cycles in Directed Graphs on the Torus and the Klein Bottle

✍ G.L. Ding; A. Schrijver; P.D. Seymour 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 203 KB

We give necessary and sufficient conditions for a directed graph embedded on the torus or the Klein bottle to contain pairwise disjoint circuits, each of a given orientation and homotopy, and in a given order. For the Klein bottle, the theorem is new. For the torus, the theorem was proved before by

On embeddings of graphs containing noK5-

On embeddings of graphs containing noK5-minor

✍ Zhang, Cun-Quan 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 246 KB 👁 2 views

In this paper, w e proved that every 2-connected graph containing no &-minor has a closed 2-cell embedding on some 2-manifold surface.