✦ LIBER ✦

Maximization coloring problems on graphs with few

✍ Scribed by Campos, Victor; Linhares-Sales, Cláudia; Sampaio, Rudini; Maia, Ana Karolinna

Book ID: 122305271
Publisher: Elsevier Science
Year: 2014
Tongue: English
Weight: 433 KB
Volume: 164
Category: Article
ISSN: 0166-218X
DOI: 10.1016/j.dam.2013.10.031

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Restricted coloring problems on graphs w

Restricted coloring problems on graphs with few

✍ V. Campos; C. Linhares Sales; K. Maia; N. Martins; R. Sampaio 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 169 KB

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

Restricted coloring problems on Graphs w

Restricted coloring problems on Graphs with fewP4’s

✍ Linhares-Sales, Cláudia; Maia, Ana Karolinna; Martins, Nicolas; Sampaio, Rudini 📂 Article 📅 2014 🏛 Springer US 🌐 English ⚖ 313 KB

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

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