Table of Contents
Fetching ...

Toroidal Cartesian Products Where One Factor is 3-Connected

Elizabeth Badgett, Christian Millichap

TL;DR

We study the toroidal embeddings of Cartesian products $G \boxempty H$ where the factor $G$ is $3$-connected. Our approach combines Euler characteristic bounds and minor arguments to restrict the second factor to $P_2$ and derive that $G \boxempty H$ is toroidal only when $H = P_2$ and $G$ is outer-cylindrical, with a constructive embedding provided in the other direction. A key by-product is that $\gamma(K_4 \boxempty P_3) = 2$, and we exhibit infinite families such as $C^2_{2n} \boxempty P_2$ that realize toroidal products. These results illuminate how vertex connectivity constrains toroidal embeddability of Cartesian products and contribute to broader classification efforts for toroidal Cartesian products.

Abstract

In this paper, we show that if $G$ is $3$-connected, then the Cartesian product of graphs $G \square H$ embeds on the torus if and only if $G$ is outer-cylindrical and $H$ is a path on two vertices, $P_2$. As a by-product of our work, we also show that $K_{4} \square P_{3}$ has genus two.

Toroidal Cartesian Products Where One Factor is 3-Connected

TL;DR

We study the toroidal embeddings of Cartesian products where the factor is -connected. Our approach combines Euler characteristic bounds and minor arguments to restrict the second factor to and derive that is toroidal only when and is outer-cylindrical, with a constructive embedding provided in the other direction. A key by-product is that , and we exhibit infinite families such as that realize toroidal products. These results illuminate how vertex connectivity constrains toroidal embeddability of Cartesian products and contribute to broader classification efforts for toroidal Cartesian products.

Abstract

In this paper, we show that if is -connected, then the Cartesian product of graphs embeds on the torus if and only if is outer-cylindrical and is a path on two vertices, . As a by-product of our work, we also show that has genus two.

Paper Structure

This paper contains 4 sections, 11 theorems, 5 equations.

Key Result

theorem 1

Let $H$ and $G$ be simple, connected, nontrivial graphs, and suppose $G$ is $3$-connected. Then $G \boxempty H$ is toroidal if and only if $G$ is an outer-cylindrical graph and $H = P_2$.

Theorems & Definitions (19)

  • theorem 1
  • proposition thmcounterproposition
  • proposition thmcounterproposition
  • proof
  • corollary thmcountercorollary
  • lemma thmcounterlemma
  • proof
  • proposition thmcounterproposition
  • proof
  • lemma thmcounterlemma
  • ...and 9 more