✦ LIBER ✦

The genus of the Cartesian product of two graphs

✍ Scribed by Arthur T White

Publisher: Elsevier Science
Year: 1971
Tongue: English
Weight: 248 KB
Volume: 11
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(71)90018-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Genus of cartesian products of regular b

Genus of cartesian products of regular bipartite graphs

✍ Tomaž Pisanski 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 545 KB

Nonorientable genus of cartesian product

Nonorientable genus of cartesian products of regular graphs

✍ Tomaž Pisanski 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 565 KB

## Abstract A special type of surgery developed by A. T. White and later used by the author to construct orientable quadrilateral embeddings of Cartesian products of graphs is here expanded to cover the nonorientable case as well. This enables the nonorientable genus of many families of Cartesian p

Game coloring the Cartesian product of g

Game coloring the Cartesian product of graphs

✍ Xuding Zhu 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 186 KB

## Abstract This article proves the following result: Let __G__ and __G__′ be graphs of orders __n__ and __n__′, respectively. Let __G__^\*^ be obtained from __G__ by adding to each vertex a set of __n__′ degree 1 neighbors. If __G__^\*^ has game coloring number __m__ and __G__′ has acyclic chromat

On the weak reconstruction of Cartesian-

On the weak reconstruction of Cartesian-product graphs

✍ Wilfried Imrich; Janez Ẑerovnik 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 590 KB

The chromatic difference sequence of the

The chromatic difference sequence of the Cartesian product of graphs

✍ Huishan Zhou 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 953 KB

Zhou, H., The chromatic difference sequence of the Cartesian product of graphs, Discrete Mathematics 90 (1991) 297-311. The chromatic difference sequence cds(G) of a graph G with chromatic number n is defined by cds(G) = (a(l), a(2), . . , a(n)) if the sum of a(l), a(2), . , a(t) is the maximum numb

On genus imbeddings of the tensor produc

On genus imbeddings of the tensor product of graphs

✍ Abay-Asmerom, Ghidewon 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 566 KB

In this article new genus results for the tensor product H @ G are presented. The second factor G in H @ G is a Cayley graph. The imbedding technique used to establish these results combines surgery and voltage graph theory. This technique was first used by A. T. White [171. This imbedding technique