Sciweavers

SIAMDM
2008
115views more  SIAMDM 2008»
13 years 4 months ago
Rank-Width and Well-Quasi-Ordering
Robertson and Seymour (1990) proved that graphs of bounded tree-width are well-quasi-ordered by the graph minor relation. By extending their arguments, Geelen, Gerards, and Whittle...
Sang-il Oum