Edge-coloring and Classification Problem
Given a graph G, the classification problem consists on to answer
how many colors are necessary to color the edges of G such that edges incident to the
same vertex have different colors. I have a especial interest in the classification problem
of split graphs, multipartite graphs, cobipartite graphs and indifference graphs.
Intersection Graphs
Characterization and representation of some graphs such as:
- Indifference graphs
- Interval graphs
- Permutation graphs
- PI graphs
- Trapezoid graphs
- Parallelogram graphs
Algorithms in Graph Theory
Recognition algorithms, edge-coloring algorithms, and other efficient algorithms that
solve problems that are hard in the general case.