Graph theory and algorithms
Celina M.H. de Figueiredo, Jayme Luiz SZWARCFITER · Journal of the Brazilian Computer Society · 2012
This special issue of the Journal of the Brazilian Computer Society is dedicated to the Fourth Latin-American Workshop on Cliques in Graphs, which was held in Itaipava, Brazil, in November 2010.The proceedings containing extended abstracts were published in Matemática Contemporânea, Volume 39.The present issue contains a selection of refereed full papers, among those presented at the Workshop.Graph theory and algorithms are areas that have become increasingly more important within theoretical computer science and discrete mathematics.Their importance stems both from the numerous challenging beautiful theoretical problems, as well as from the several applications in a great variety of areas, within and outside computer science.The Latin-American Workshop on Cliques in Graphs is focused on structural problems in graph theory and is becoming a traditional event in the area.Previous workshops were held in Brazil (2002), Argentina (2006), and Mexico (2008), while the Fifth Workshop is scheduled to be held in Argentina, later this year.The present volume contains the following papers."Sandwich problems on orientations," by O.D. de Gevigney, S. Klein, V.-H.Nguyen, and Z. Szigeti.The authors consider sandwich problems aiming to obtain graphs satisfying certain conditions on their orientations.In particular, polynomial-time algorithms are described for the problem of deciding the existence of a sandwich graph admitting an C.