✦ LIBER ✦

Even edge colorings of a graph

✍ Scribed by B. Devadas Acharya

Publisher: Elsevier Science
Year: 1983
Tongue: English
Weight: 78 KB
Volume: 35
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(83)90081-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

✍ Noga Alon; Yoshimi Egawa 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 59 KB

Edge-colored saturated graphs

✍ D. Hanson; B. Toft 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 266 KB

Edge-Coloring Bipartite Graphs

✍ Ajai Kapoor; Romeo Rizzi 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 65 KB

Given a bipartite graph G with n nodes, m edges, and maximum degree ⌬, we Ž . find an edge-coloring for G using ⌬ colors in time T q O m log ⌬ , where T is the time needed to find a perfect matching in a k-regular bipartite graph with Ž . O m edges and k F ⌬. Together with best known bounds for T th

Interval edge coloring of a graph with f

Interval edge coloring of a graph with forbidden colors

✍ Marek Kubale 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 596 KB

## This paper is complementary to Kubale (1989). We consider herein a problem of interval coloring the edges of a graph under the restriction that certain colors cannot be used for some edges. We give lower and upper bounds on the minimum number of colors required for such a coloring. Since the ge

Coloring edges of embedded graphs

✍ Daniel P. Sanders; Yue Zhao 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 80 KB 👁 2 views

In this paper, we prove that any graph G with maximum degree ÁG ! 11 p 49À241AEa2, which is embeddable in a surface AE of characteristic 1AE 1 and satis®es jVGj b 2ÁGÀ5À2 p 6ÁG, is class one.

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′__(_