Predavatelj: Jesús Leaños
The crossing number of a graph G is the minimum number of pairwise intersections of edges in a drawing
of G in the plane. The problem of determining the crossing number of a graph is a well-known problem in topological graph theory which remains open for the most graphs. In this talk we give the basic concepts and discuss some of our contributions.
of G in the plane. The problem of determining the crossing number of a graph is a well-known problem in topological graph theory which remains open for the most graphs. In this talk we give the basic concepts and discuss some of our contributions.
