66 search results - page 1 / 14 » Balanced coloring of bipartite graphs |
JGT
2010
13 years 3 months ago
2010
IPL
2010
13 years 2 months ago
2010
Polynomial algorithms are given for the following two problems:
ESA
2008
Springer
13 years 6 months ago
2008
Springer
We consider two generalizations of the edge coloring problem in bipartite graphs. The first problem we consider is the weighted bipartite edge coloring problem where we are given a...
ENDM
2010
13 years 4 months ago
2010
Galvin solved the Dinitz conjecture by proving that bipartite graphs are -edge-choosable. We employ Galvin's method to show some further list edgecolouring properties of bipa...
SIAMDM
2008
13 years 4 months ago
2008
We consider the class of graphs that contain no bull, no odd hole, and no antihole of length at least five. We present a new algorithm that colors optimally the vertices of every g...