Graph-theoretic concepts in computer science : 27th international workshop, WG 2001, Boltenhagen, Germany, June 14-16, 2001 ; proceedings / Andreas Brandstadt, Van Bang Le (eds.)
Imprint
Berlin : Springer, c2001
Descript
x, 327 p. : ill. ; 24 cm
CONTENT
Edge-isoperinmetric problems -- Regular graphs -- Constrained bipartite edge coloring -- Maximum cloque transversals -- Tree-degree of graps -- Constrained minimum vertex -- Bipartite graphs -- k,+ Distance-hereditary graphs -- Clique-width and treewith -- Families -- NP-hard graph problems coloring of graphs -- Graph subcoloring -- Outerplanar graphs -- Multiple hotlink assignment -- Small k-dominating sets -- Planar graphs -- Steiner tree problem -- AT-free graphs -- Star graphs -- Matching-cut problem -- De bruijn graph -- DNA graphs -- Generic greedy algorithm -- Perfect graphs