✦ LIBER ✦

On the chromatic number of the lexicographic product and the Cartesian sum of graphs

✍ Scribed by Niko Čižek; Sandi Klavžar

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 449 KB
Volume: 134
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(93)e0056-a

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the chromatic number of the product o

On the chromatic number of the product of graphs

✍ D. Duffus; B. Sands; R. E. Woodrow 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 429 KB 👁 1 views

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

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

On the chromatic number of disk graphs

✍ Malesi?ska, Ewa; Piskorz, Steffen; Wei�enfels, Gerhard 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 172 KB 👁 2 views

Colorings of disk graphs arise in the study of the frequency-assignment problem in broadcast networks. Motivated by the observations that the chromatic number of graphs modeling real networks hardly exceeds their clique number, we examine the related properties of the unit disk (UD) graphs and their

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

On the chromatic number of cube-like gra

On the chromatic number of cube-like graphs

✍ Charles Payan 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 343 KB

A cube-like graph is a graph whose vertices are all 2" subsets of a set E of cardinality n, in which two vertices are adjacent if their symmetric difference is a member of a given specified collection of subsets of E. Many authors were interested in the chromatic number of such graphs and thought it