@techreport{TR-IC-10-05,
   number = {IC-10-05},
   author = {Vagner Pedrotti and Célia Picinin de Mello},
   title = {Minimal separators in extended {$P_4$}-laden graphs},
   month = {February},
   year = {2010},
   institution = {Institute of Computing, University of Campinas},
   note = {In English, 17 pages.
    \par\selectlanguage{english}\textbf{Abstract}
       We  show  that extended $P_4$-laden graphs have a linear number
       of  minimal separators and present an algorithm to list them in
       linear  time,  extending  an  algorithm for $P_4$-sparse graphs
       given  by  Nikolopoulos  and Palios. We also give bounds on the
       number  and  total  size  of all minimal separators of extended
       $P_4$-laden  graphs  and  some  of  its  subclasses,  such  as, 
       $P_4$-tidy  and $P_4$-lite graphs. Moreover, we show that these
       bounds are tight for all subclasses considered.
  }
}