✦ LIBER ✦

Some results on the incidence coloring number of a graph

✍ Scribed by Jiaojiao Wu

Book ID: 108114101
Publisher: Elsevier Science
Year: 2009
Tongue: English
Weight: 444 KB
Volume: 309
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2008.10.027

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Note on a new coloring number of a graph

✍ P. Horák; J. Širáň 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 112 KB 👁 1 views

## Abstract The distance coloring number __X__~__d__~(__G__) of a graph __G__ is the minimum number __n__ such that every vertex of __G__ can be assigned a natural number __m__ ≤ __n__ and no two vertices at distance __i__ are both assigned __i__. It is proved that for any natural number __n__ ther

Some results about the interval number o

Some results about the interval number of a graph

✍ Christoph Maas 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 213 KB

On some applications of the selective gr

On some applications of the selective graph coloring problem

✍ Demange, Marc; Ekim, Tınaz; Ries, Bernard; Tanasescu, Cerasela 📂 Article 📅 2015 🏛 Elsevier Science 🌐 English ⚖ 569 KB

Some results on domination number of pro

Some results on domination number of products of graphs

✍ Shan Erfang; Sun Liang; Kang Liying 📂 Article 📅 1998 🏛 SP Editorial Committee of Applied Mathematics - A 🌐 English ⚖ 224 KB

Some Algebraic Methods for Calculating t

Some Algebraic Methods for Calculating the Number of Colorings of a Graph

✍ Yu. V. Matiyasevich 📂 Article 📅 2004 🏛 Springer US 🌐 English ⚖ 150 KB

On some colorings of a double graph

✍ Munarini, Emanuele; Perelli Cippo, Claudio 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 164 KB