✦ LIBER ✦

Bounds on Edge Colorings with Restrictions on the Union of Color Classes

✍ Scribed by Aravind, N. R.; Subramanian, C. R.

Book ID: 118197048
Publisher: Society for Industrial and Applied Mathematics
Year: 2010
Tongue: English
Weight: 217 KB
Volume: 24
Category: Article
ISSN: 0895-4801
DOI: 10.1137/080733917

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Bounds on vertex colorings with restrict

Bounds on vertex colorings with restrictions on the union of color classes

✍ N. R. Aravind; C. R. Subramanian 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 197 KB 👁 1 views

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

On-Line Edge-Coloring with a Fixed Numbe

On-Line Edge-Coloring with a Fixed Number of Colors

✍ Lene Monrad Favrholdt and Morten Nyhave Nielsen 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 134 KB

An upper bound on the number of edges of

An upper bound on the number of edges of edge-coloring critical graphs with high maximum degree

✍ Lian-ying Miao; Shi-you Pang; Jian-liang Wu 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 100 KB

In this paper, we prove that any edge-coloring critical graph G with maximum degree ¿ (11 + √ 49 -24 )=2, where 6 1, has the size at least 3(|V (G)| -) + 1 if 6 7 or if ¿ 8 and |V (G)| ¿ 2 --4 -( + 6)=( -6), where is the minimum degree of G. It generalizes a result of Sanders and Zhao.

On the edge-coloring problem for a class

On the edge-coloring problem for a class of 4-regular maps

✍ F. Jaeger; H. Shank 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 300 KB 👁 1 views

## Abstract A (plane) 4‐regular map __G__ is called __C__‐simple if it arises as a superposition of simple closed curves (tangencies are not allowed); in this case σ (__G__) is the smallest integer __k__ such that the curves of __G__ can be colored with __k__ colors in such a way that no two curves

Erratum: On the edge-coloring problem fo

Erratum: On the edge-coloring problem for a class of 4-regular maps

✍ F. Jaeger; H. Shank 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 37 KB 👁 1 views

On p. 272 of the above article, paragraph # 3 is incomplete. It should read as the following: Hence to prove Proposition 4 it is enough to show that the edges of Q 4 can be colored with 4 colors in such a way that each square has one edge of each color. Such a coloring is displayed on the following