๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Edge covering coloring of nearly bipartite graphs

โœ Scribed by Jihui Wang; Xia Zhang; Guizhen Liu

Publisher
Springer-Verlag
Year
2006
Tongue
English
Weight
184 KB
Volume
22
Category
Article
ISSN
1598-5865

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

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

On equitable coloring of bipartite graph
On equitable coloring of bipartite graphs
โœ Ko-Wei Lih; Pou-Lin Wu ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 285 KB

If the vertices of a graph G are partitioned into k classes V~, I/2 ..... Vk such that each V~ is an independent set and I1V~I-IV~[I ~< 1 for all i#j, then G is said to be equitably colored with k colors. The smallest integer n for which G can be equitably colored with n colors is called the equitab