✦ LIBER ✦

Coloring certain proximity graphs

✍ Scribed by R.J. Cimikowski

Book ID: 103930655
Publisher: Elsevier Science
Year: 1990
Tongue: English
Weight: 912 KB
Volume: 20
Category: Article
ISSN: 0898-1221
DOI: 10.1016/0898-1221(90)90032-f

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the total coloring of certain graphs

✍ M. Rosenfeld 📂 Article 📅 1971 🏛 The Hebrew University Magnes Press 🌐 English ⚖ 248 KB

Applications of hypergraph coloring to c

Applications of hypergraph coloring to coloring graphs not inducing certain trees

✍ H.A. Kierstead; V. Rodl 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 385 KB

We present a simple result on coloring hypergraphs and use it to obtain bounds on the chromatic number of graphs which do not induce certain trees. ## O. Introduction A class of graphs F is said to be x-bounded if there exists a functionfsuch that for all graphs G e F, (.) z(G) <~f(og(G)), where

Coloring fuzzy graphs

✍ Susana Muñoz; M. Teresa Ortuño; Javier Ramı́rez; Javier Yáñez 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 288 KB

Coloring of universal graphs

✍ Peter Komjáth; Vojtèch Rödl 📂 Article 📅 1986 🏛 Springer Japan 🌐 English ⚖ 341 KB

Equitable -coloring of graphs

✍ Bor-Liang Chen; Chih-Hung Yen 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 230 KB

-coloring of sparse graphs

✍ O.V. Borodin; A.O. Ivanova; M. Montassier; A. Raspaud 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 262 KB