Publisher
Springer International Publishing
Reference27 articles.
1. Cabello, S., Jejčič, M.: Refining the hierarchies of classes of geometric intersection graphs. Electr. J. Comb. 24(1), P1.33 (2017).
http://www.combinatorics.org/ojs/index.php/eljc/article/view/v24i1p33
2. Cardinal, J., Felsner, S., Miltzow, T., Tompkins, C., Vogtenhuber, B.: Intersection graphs of rays and grounded segments. J. Graph Algorithms Appl. 22(2), 273–295 (2018).
https://doi.org/10.7155/jgaa.00470
3. Catanzaro, D., Chaplick, S., Felsner, S., Halldórsson, B.V., Halldórsson, M.M., Hixon, T., Stacho, J.: Max point-tolerance graphs. Discrete Appl. Math. 216, 84–97 (2017).
https://doi.org/10.1016/j.dam.2015.08.019
4. Chalopin, J., Gonçalves, D.: Every planar graph is the intersection graph of segments in the plane: extended abstract. In: STOC 2009, pp. 631–638. ACM (2009).
https://doi.org/10.1145/1536414.1536500
5. Chaplick, S., Dorbec, P., Kratochvíl, J., Montassier, M., Stacho, J.: Contact representations of planar graphs: extending a partial representation is hard. In: Kratsch, D., Todinca, I. (eds.) WG 2014. LNCS, vol. 8747, pp. 139–151. Springer, Heidelberg (2014).
https://doi.org/10.1007/978-3-319-12340-0_12