Author:
Chakraborty Dibyayan,Das Sandip,Mukherjee Joydeep,Sahoo Uma Kant
Funder
Science and Engineering Research Board
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Theoretical Computer Science
Reference19 articles.
1. Asinowski, A., Cohen, E., Golumbic, M.C., Limouzy, V., Lipshteyn, M., Stern, M.: Vertex intersection graphs of paths on a grid. Journal of Graph Algorithms and Applications 16(2), 129–150 (2012)
2. Bertossi, A.A.: Dominating sets for split and bipartite graphs. Inf. Process. Lett. 19(1), 37–40 (1984)
3. Biedl, T.C., Derka, M.: 1-String B
2-VPG representation of planar graphs. In: 31St International Symposium on Computational Geometry, SoCG 2015, June 22-25, 2015, Eindhoven, The Netherlands, pp. 141–155 (2015)
4. Chaplick, S., Cohen, E., Stacho, J.: Recognizing some subclasses of vertex intersection graphs of 0-bend paths in a grid. In: Graph-Theoretic Concepts in Computer Science, pp. 319–330. Springer (2011)
5. Chaplick, S., Jelínek, V., Kratochvil, J., Vyskočil, T.: Bend-bounded path intersection graphs: sausages, noodles, and waffles on a grill. In: Graph-Theoretic Concepts in Computer Science, pp. 274–285. Springer (2012)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献