𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Minimal coloring and strength of graphs

✍ Scribed by H. Hajiabolhassan; M.L. Mehrabadi; R. Tusserkani

Book ID
108316433
Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
86 KB
Volume
215
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Interference-Minimizing Colorings of Reg
Interference-Minimizing Colorings of Regular Graphs
✍ Fishburn, P. C.; Kim, J. H.; Lagarias, J. C.; Wright, P. E. πŸ“‚ Article πŸ“… 1998 πŸ› Society for Industrial and Applied Mathematics 🌐 English βš– 389 KB
Star coloring of graphs
Star coloring of graphs
✍ Guillaume Fertin; AndrΓ© Raspaud; Bruce Reed πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 181 KB

## Abstract A __star coloring__ of an undirected graph __G__ is a proper vertex coloring of __G__ (i.e., no two neighbors are assigned the same color) such that any path of length 3 in __G__ is not bicolored. The __star chromatic number__ of an undirected graph __G__, denoted by Ο‡~s~(__G__), is the

Coloring of universal graphs
Coloring of universal graphs
✍ Peter KomjΓ‘th; VojtΓ¨ch RΓΆdl πŸ“‚ Article πŸ“… 1986 πŸ› Springer Japan 🌐 English βš– 341 KB