论文信息 - Can they cross? and how?: (the hitchhiker's guide to the universe of geometric intersection graphs)

Can they cross? and how?: (the hitchhiker's guide to the universe of geometric intersection graphs)

Geometric representations of graphs are intensively studied for their practical motivations and applications, as well as interesting structural and theoretical properties. We will survey recent results, persistent open problems, and prospective directions of further research in this exciting area lying on the border of graph theory and computational geometry.

Jan Kratochvíl

[1] Marcus Schaefer,et al. Decidability of string graphs , 2001, STOC '01.

[2] F. Sinden. Topology of thin film RC circuits , 1966 .

[3] Jérémie Chalopin,et al. Every planar graph is the intersection graph of segments in the plane: extended abstract , 2009, STOC '09.

[4] Patrice Ossona de Mendez,et al. On Triangle Contact Graphs , 1994, Combinatorics, Probability and Computing.

[5] Marcus Schaefer,et al. Recognizing string graphs in NP , 2002, STOC '02.

[6] János Pach,et al. Recognizing String Graphs Is Decidable , 2001, GD.

[7] Robert E. Tarjan,et al. Intersection graphs of curves in the plane , 1976, J. Comb. Theory, Ser. B.

[8] János Pach. Why Are String Graphs So Beautiful? , 2009, Graph Drawing.

[9] Jérémie Chalopin,et al. Planar graphs are in 1-STRING , 2007, SODA '07.

[10] Jan Kratochvíl,et al. String graphs requiring exponential representations , 1991, J. Comb. Theory, Ser. B.

[11] Jan Kratochvíl,et al. String graphs. II. recognizing string graphs is NP-hard , 1991, J. Comb. Theory, Ser. B.