✦ LIBER ✦

Near-proper vertex 2-colorings of sparse graphs

✍ Scribed by O. V. Borodin; A. O. Ivanova

Book ID: 111471258
Publisher: Pleiades Publishing
Year: 2010
Tongue: English
Weight: 420 KB
Volume: 4
Category: Article
ISSN: 1990-4789
DOI: 10.1134/s1990478910010047

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the Vertex-Distinguishing Proper Edge

On the Vertex-Distinguishing Proper Edge-Colorings of Graphs

✍ Cristina Bazgan; Amel Harkat-Benhamdine; Hao Li; Mariusz Woźniak 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 189 KB

We prove the conjecture of Burris and Schelp: a coloring of the edges of a graph of order n such that a vertex is not incident with two edges of the same color and any two vertices are incident with different sets of colors is possible using at most n+1 colors. 1999 Academic Press ## 1. Introducti

Injective colorings of sparse graphs

✍ Daniel W. Cranston; Seog-Jin Kim; Gexin Yu 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 338 KB

Nonrepetitive vertex colorings of graphs

✍ Jochen Harant; Stanislav Jendrol’ 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 229 KB

Bounded vertex colorings of graphs

✍ Pierre Hansen; Alain Hertz; Julio Kuplinsky 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 503 KB

Vertex-distinguishing edge-colorings of

Vertex-distinguishing edge-colorings of 2-regular graphs

✍ P. Wittmann 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 755 KB

Aigner et al., proved that for the irregular coloring number c(G) of a simple 2-regular graph of order n the inequality c(G) < v'& + 0( 1) holds. Here it is shown that c(G) < & + 0( 1).

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