Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
COMBINATORICS
2006
114views more  COMBINATORICS 2006»
11 years 9 months ago
Total 4-Choosability of Series-Parallel Graphs
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...
Douglas R. Woodall
COMBINATORICS
2006
121views more  COMBINATORICS 2006»
11 years 9 months ago
Edge and Total Choosability of Near-Outerplanar Graphs
It is proved that, if G is a K4-minor-free graph with maximum degree 4, then G is totally ( + 1)-choosable; that is, if every element (vertex or edge) of G is assigned a list of ...
Timothy J. Hetherington, Douglas R. Woodall
FOCS
2008
IEEE
12 years 4 months ago
Embeddings of Topological Graphs: Lossy Invariants, Linearization, and 2-Sums
We study the properties of embeddings, multicommodity flows, and sparse cuts in minor-closed families of graphs which are also closed under 2-sums; this includes planar graphs, g...
Amit Chakrabarti, Alexander Jaffe, James R. Lee, J...
books