✦ LIBER ✦

On Edge Coloring Bipartite Graphs

✍ Scribed by Cole, Richard; Hopcroft, John

Book ID: 118174089
Publisher: Society for Industrial and Applied Mathematics
Year: 1982
Tongue: English
Weight: 825 KB
Volume: 11
Category: Article
ISSN: 0097-5397
DOI: 10.1137/0211043

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On sum edge-coloring of regular, biparti

On sum edge-coloring of regular, bipartite and split graphs

✍ Petrosyan, P.A.; Kamalian, R.R. 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 312 KB

Multirate Rearrangeable Clos Networks an

Multirate Rearrangeable Clos Networks and a Generalized Edge-Coloring Problem on Bipartite Graphs

✍ Ngo, Hung Q.; Vu, Van H. 📂 Article 📅 2003 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 334 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

Edge coloring nearly bipartite graphs

✍ Bruce Reed 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 77 KB

Edge covering coloring of nearly biparti

Edge covering coloring of nearly bipartite graphs

✍ Jihui Wang; Xia Zhang; Guizhen Liu 📂 Article 📅 2006 🏛 Springer-Verlag 🌐 English ⚖ 184 KB

Analysis of approximate algorithms for e

Analysis of approximate algorithms for edge-coloring bipartite graphs

✍ Ravi Jain; John Werth 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 513 KB