𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The Menger number of the Cartesian product of graphs

✍ Scribed by Meijie Ma; Jun-Ming Xu; Qiang Zhu

Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
203 KB
Volume
24
Category
Article
ISSN
0893-9659

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The binding numbers of some Cartesian pr
The binding numbers of some Cartesian products of graphs
✍ Danuta Michalak πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 238 KB

In the paper we obtain some conditions under which the binding number bind (C) of a Cartesian product graph G is equal to The concept of the binding number of a graph was introduced by Woodall in 1973 . The main theorem of Woodall's paper is a sufficient condition for the existence of a Hamiltonian

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