3 search results - page 1 / 1 » List Edge-Colorings of Series-Parallel Graphs |
COMBINATORICS
1999
14 years 6 months ago
1999
COMBINATORICS
2006
14 years 6 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...
ICC
2007
IEEE
15 years 27 days ago
2007
IEEE
— This paper presents a transmission scheduling scheme in sensor networks. Each node is assigned a list of time slots to use for unicast and broadcast communication. The algorith...