Geometric intersection graphs

author: Jan Kratochvíl, Charles University Prague
published: Sept. 7, 2007,   recorded: September 2007,   views: 8367

Related Open Educational Resources

Related content

Report a problem or upload files

If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Lecture popularity: You need to login to cast your vote.


Geometric intersection graphs are intensively studied both for their practical motivations and interesting theoretical properties. Many classes allow elegant characterizations, for many of them optimization problems NP-hard in general can be solved in polynomial time. We will present a survey of recent results and old problems in this area, including questions related to colorability, maximum clique or representations of planar and co-planar graphs. Computational complexity of recognition of many of intersection defined classes of graphs will be one of the main topics.

Link this page

Would you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !

Write your own review or comment:

make sure you have javascript enabled or clear this field: