P. A. Guil Asensio

Learn More
i Abstract In this thesis, we consider graph embeddings into the class of chordal graphs (so-called triangulations), by which, for greater classes of graphs, we obtain new structural results and efficient algorithms for computing various graph parameters. The minimal separators in a graph play an important role for graph triangu-lations. For this reason, we(More)
  • 1