𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Mixed graph edge coloring

✍ Scribed by Hanna Furmańczyk; Adrian Kosowski; Bernard Ries; Paweł Żyliński

Book ID
108114110
Publisher
Elsevier Science
Year
2009
Tongue
English
Weight
987 KB
Volume
309
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

3-consecutive edge coloring of a graph
3-consecutive edge coloring of a graph
✍ Cs. Bujtás; E. Sampathkumar; Zs. Tuza; Ch. Dominic; L. Pushpalatha 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 301 KB
An edge coloring problem for graph produ
An edge coloring problem for graph products
✍ Faudree, R. J.; Gy�rf�s, Andr�as; Schelp, R. H. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 315 KB 👁 1 views

The edges of the Cartesian product of graphs G x H a r e to be colored with the condition that all rectangles, i.e., K2 x K2 subgraphs, must be colored with four distinct colors. The minimum number of colors in such colorings is determined for all pairs of graphs except when G is 5-chromatic and H

Edge-colored saturated graphs
Edge-colored saturated graphs
✍ D. Hanson; B. Toft 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 266 KB
Edge-Coloring Bipartite Graphs
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

Mixed graph colorings
Mixed graph colorings
✍ Pierre Hansen; Julio Kuplinsky; Dominique de Werra 📂 Article 📅 1997 🏛 Springer 🌐 English ⚖ 697 KB