✦ LIBER ✦

Injective colorings of sparse graphs

✍ Scribed by Daniel W. Cranston; Seog-Jin Kim; Gexin Yu

Book ID: 108114255
Publisher: Elsevier Science
Year: 2010
Tongue: English
Weight: 338 KB
Volume: 310
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2010.07.003

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Acyclic edge-colorings of sparse graphs

✍ Y. Caro; Y. Roditty 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 393 KB

A k-forest is a forest in which the maximum degree is k. The k-arboricity denoted Ak(G) is the minimum number of k-forests whose union is the graph G. We show that if G is an m-degenerate graph of maximum degree A, then Ak(G) 5 [(A + (k -1) m -1)/k], k 2 2, and derive several consequences of this in

Injective Colorings of Graphs with Low A

Injective Colorings of Graphs with Low Average Degree

✍ Daniel W. Cranston; Seog-Jin Kim; Gexin Yu 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 554 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

-coloring of sparse graphs

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

-coloring of sparse graphs

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

Near-proper vertex 2-colorings of sparse

Near-proper vertex 2-colorings of sparse graphs

✍ O. V. Borodin; A. O. Ivanova 📂 Article 📅 2010 🏛 Pleiades Publishing 🌐 English ⚖ 420 KB