𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Coloring Problem With Restrictions of Adjacent Colors

✍ Scribed by Uejima Akihiro; Ito Hiro; Uehara Hideyuki; Yokoyama Mitsuo


Book ID
108572764
Publisher
John Wiley and Sons
Year
2002
Tongue
English
Weight
247 KB
Volume
9
Category
Article
ISSN
0969-6016

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Restricted coloring problems on graphs w
✍ V. Campos; C. Linhares Sales; K. Maia; N. Martins; R. Sampaio πŸ“‚ Article πŸ“… 2011 πŸ› Elsevier Science 🌐 English βš– 169 KB
Vertex colorings with a distance restric
✍ Guantao Chen; AndrΓ‘s GyΓ‘rfΓ‘s; R.H. Schelp πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 787 KB

Let d, k be any two positive integers with k > d > 0. We consider a k-coloring of a graph G such that the distance between each pair of vertices in the same color-class is at least d. Such graphs are said to be (k,d)-colorable. The object of this paper is to determine the maximum size of (k, 3)-colo

A coloring problem
✍ V. L. Dol'nikov πŸ“‚ Article πŸ“… 1973 πŸ› SP MAIK Nauka/Interperiodica 🌐 English βš– 725 KB