✦ LIBER ✦

Configuration and minimal coloring of disbalanced graphs

✍ Scribed by Ya. R. Grinberg; A. M. Rappoport

Book ID: 111455420
Publisher: SP MAIK Nauka/Interperiodica
Year: 2011
Tongue: English
Weight: 154 KB
Volume: 84
Category: Article
ISSN: 1064-5624
DOI: 10.1134/s1064562411050085

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Minimal coloring and strength of graphs

✍ H. Hajiabolhassan; M.L. Mehrabadi; R. Tusserkani 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 86 KB

Minimal configuration bicyclic graphs

✍ Nath, Milan 📂 Article 📅 2012 🏛 Taylor and Francis Group 🌐 English ⚖ 138 KB

Configuration Spaces of Colored Graphs

✍ Aaron Abrams 📂 Article 📅 2002 🏛 Springer 🌐 English ⚖ 155 KB

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

Coloring chip configurations on graphs a

Coloring chip configurations on graphs and digraphs

✍ Mieczysław Borowiecki; Jarosław Grytczuk; Monika Pilśniak 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 131 KB

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