𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Panconnectivity of Cartesian product graphs

✍ Scribed by You Lu; Jun-Ming Xu

Publisher
Springer US
Year
2009
Tongue
English
Weight
352 KB
Volume
56
Category
Article
ISSN
0920-8542

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

s-strongly perfect cartesian product of
s-strongly perfect cartesian product of graphs
✍ Elefterie Olaru; Eugen Mǎndrescu πŸ“‚ Article πŸ“… 1992 πŸ› John Wiley and Sons 🌐 English βš– 308 KB

## Abstract The study of perfectness, via the strong perfect graph conjecture, has given rise to numerous investigations concerning the structure of many particular classes of perfect graphs. In β€œPerfect Product Graphs” (__Discrete Mathematics__, Vol. 20, 1977, pp. 177‐‐186), G. Ravindra and K. R.