𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Edge coloring nearly bipartite graphs

✍ Scribed by Bruce Reed

Book ID
108410544
Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
77 KB
Volume
24
Category
Article
ISSN
0167-6377

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

Nearly bipartite graphs
Nearly bipartite graphs
✍ E. GyΕ‘ri; V. Nikiforov; R.H. Schelp πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 148 KB
Star coloring bipartite planar graphs
Star coloring bipartite planar graphs
✍ H. A. Kierstead; AndrΓ© KΓΌndgen; Craig Timmons πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 139 KB

## Abstract A __star coloring__ of a graph is a proper vertex‐coloring such that no path on four vertices is 2‐colored. We prove that the vertices of every bipartite planar graph can be star colored from lists of size 14, and we give an example of a bipartite planar graph that requires at least eig

Balanced coloring of bipartite graphs
Balanced coloring of bipartite graphs
✍ Uriel Feige; Shimon Kogan πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 128 KB

## Abstract Given a bipartite graph __G__(__U__βˆͺ__V, E__) with __n__ vertices on each side, an independent set __I__∈__G__ such that |__U__∩__I__|=|__V__∩__I__| is called a balanced bipartite independent set. A balanced coloring of __G__ is a coloring of the vertices of __G__ such that each color c