2 search results - page 1 / 1 » Total 4-Choosability of Series-Parallel Graphs |
COMBINATORICS
2006
13 years 4 months ago
2006
It is proved that, if G is a K4-minor-free graph with maximum degree 3, then G is totally 4-choosable; that is, if every element (vertex or edge) of G is assigned a list of 4 colo...
IPCO
2010
13 years 6 months ago
2010
Abstract. We study the quality of equilibrium in atomic splittable routing games. We show that in single-source single-sink games on seriesparallel graphs, the price of collusion -...