This web page contains the abstract of my paper:
"A Class of Perfect Graphs", SIAM J. Alg. and Disc. Meth., 3(1982), p. 281-284.
Abstract: Let P be a simply connected polyomino. Let G(P) be the graph whose vertices are the maximal rectangles in P, two such vertices being adjacent if the corresponding rectangles have nontrivial intersection. In this paper we show that G(P) is perfect. This solves a problem posed by Berge et al.
IBM Research home page |
James B. Shearer's home page |
[ IBM home page | Order | Search | Contact IBM | Help | (C) | (TM) ]