𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Behzad-Vizing conjecture and Cartesian-product graphs

✍ Scribed by B. Zmazek; J. Ẑerovnik

Publisher
Elsevier Science
Year
2002
Tongue
English
Weight
308 KB
Volume
15
Category
Article
ISSN
0893-9659

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On a Vizing-like conjecture for direct p
On a Vizing-like conjecture for direct product graphs
✍ Sandi Klavẑar; Blaẑ Zmazek 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 163 KB

Let 7(G) be the domination number of a graph G, and let G ×H be the direct product of graphs G and H. It is shown that for any k t> 0 there exists a graph G such that 7(G × G) ~< 7(G) 2 -k. This in particular disproves a conjecture from .

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.