暂无分享,去创建一个
[1] A. Brandstädt,et al. Graph Classes: A Survey , 1987 .
[2] Sergio Cabello,et al. Refining the Hierarchies of Classes of Geometric Intersection Graphs , 2016, Electron. Notes Discret. Math..
[3] Md. Iqbal Hossain,et al. L-Graphs and Monotone L-Graphs , 2017, ArXiv.
[4] Vojtech Rödl,et al. On the Computational Complexity of Ordered Subgraph Recognition , 1995, Random Struct. Algorithms.
[5] Bojan Mohar,et al. Ordering without Forbidden Patterns , 2014, ESA.
[6] Jérémie Chalopin,et al. Every planar graph is the intersection graph of segments in the plane: extended abstract , 2009, STOC '09.
[7] Jean Cardinal,et al. Intersection Graphs of Rays and Grounded Segments , 2016, WG.
[8] Janos Pach,et al. On the Chromatic Number of Disjointness Graphs of Curves , 2018, SoCG.
[9] P. Damaschke,et al. Forbidden Ordered Subgraphs , 1990 .
[10] Sean McGuinness. On bounding the chromatic number of L-graphs , 1996, Discret. Math..
[11] Christopher Thraves,et al. p-Box: A new graph model , 2015, Discret. Math. Theor. Comput. Sci..
[12] M. Middendorf,et al. The max clique problem in classes of string-graphs , 1992, Discret. Math..
[13] Bartosz Walczak,et al. Outerstring Graphs are χ-Bounded , 2019, SIAM J. Discret. Math..
[14] Claire Pennarun,et al. Planar Graphs as L-intersection or L-contact graphs , 2017, SODA.