✦ LIBER ✦

Balanced edge colorings

✍ Scribed by P.N. Balister; A. Kostochka; Hao Li; R.H. Schelp

Book ID: 108395407
Publisher: Elsevier Science
Year: 2004
Tongue: English
Weight: 309 KB
Volume: 90
Category: Article
ISSN: 0095-8956
DOI: 10.1016/s0095-8956(03)00073-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Multiply balanced edge colorings of mult

Multiply balanced edge colorings of multigraphs

✍ M. A. Bahmanian; C. A. Rodger 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 259 KB

## Abstract In this article, a theorem is proved that generalizes several existing amalgamation results in various ways. The main aim is to disentangle a given edge‐colored amalgamated graph so that the result is a graph in which the edges are shared out among the vertices in ways that are fair wit

On balanced colorings of hypergraphs

✍ A. P. Rozovskaya; M. V. Titova; D. A. Shabanov 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 205 KB

Vertex-distinguishing proper edge-colori

Vertex-distinguishing proper edge-colorings

✍ Burris, A. C.; Schelp, R. H. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 146 KB

An edge-coloring is called vertex-distinguishing if every two distinct vertices are incident to different sets of colored edges. The minimum number of colors required for a vertex-distinguishing proper edge-coloring of a simple graph G is denoted by χ s (G). A simple count shows that χ s (G) ≥ max{(

Acyclic edge colorings of graphs

✍ Noga Alon; Benny Sudakov; Ayal Zaks 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 102 KB

## Abstract A proper coloring of the edges of a graph __G__ is called __acyclic__ if there is no 2‐colored cycle in __G__. The __acyclic edge chromatic number__ of __G__, denoted by __a′__(__G__), is the least number of colors in an acyclic edge coloring of __G__. For certain graphs __G__, __a′__(_

Edge Colorings of Embedded Graphs

✍ Zhongde Yan; Yue Zhao 📂 Article 📅 2000 🏛 Springer Japan 🌐 English ⚖ 125 KB

Strong edge colorings of graphs

✍ Odile Favaron; Hao Li; R.H. Schelp 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 349 KB

Let x'(G), called the strong coloring number of G, denote the minimum number of colors for which there is a proper edge coloring of a graph G in which no two of its vertices is incident to edges colored with the same set of colors. It is shown that Z'~(G) ~< Fcn], ½ < c ~ 1, whenever A(G) is appropr