✦ LIBER ✦

Restricted coloring problems on graphs with few

✍ Scribed by V. Campos; C. Linhares Sales; K. Maia; N. Martins; R. Sampaio

Book ID: 108120801
Publisher: Elsevier Science
Year: 2011
Tongue: English
Weight: 169 KB
Volume: 37
Category: Article
ISSN: 1571-0653
DOI: 10.1016/j.endm.2011.05.011

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Coloring graphs with locally few colors

✍ P Erdös; Z Füredi; A Hajnal; P Komjáth; V Rödl; Á Seress 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 832 KB

Let G be a graph, m > r t> 1 integers. Suppose that it has a good-coloring with m colors which uses at most r colors in the neighborhood of every vertex. We investigate these so-called local r-colorings. One of our results (Theorem 2.4) states: The chromatic number of G, Chr(G) ~< r2" log21og2 m (an

Injective colorings of planar graphs wit

Injective colorings of planar graphs with few colors

✍ Borut Lužar; Riste Škrekovski; Martin Tancer 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 945 KB

On sum coloring and sum multi-coloring f

On sum coloring and sum multi-coloring for restricted families of graphs

✍ Allan Borodin; Ioana Ivan; Yuli Ye; Bryce Zimny 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 982 KB

Coloring the vertices of a graph with ma

Coloring the vertices of a graph with majority restrictions on colors

✍ V. G. Vizing 📂 Article 📅 2010 🏛 Pleiades Publishing 🌐 English ⚖ 438 KB

Vertex cover in graphs with locally few

Vertex cover in graphs with locally few colors

✍ Fabian Kuhn; Monaldo Mastrolilli 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 269 KB

Graphs with full rank 3-color matrix and

Graphs with full rank 3-color matrix and few 3-colorings

✍ Serguei Norine; Jean-Sébastien Sereni 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 69 KB