Publisher
Springer Berlin Heidelberg
Reference17 articles.
1. Biedl, T.C., Kant, G., Kaufmann, M.: On triangulating planar graphs under the four-connectivity constraint. Algorithmica 19(4), 427–446 (1997)
2. Lecture Notes in Computer Science;N. Bonichon,2005
3. Lecture Notes in Computer Science;N. Bonichon,2004
4. de Fraysseix, H., Ossona de Mendez, P., Pach, J.: Representation of planar graphs by segments. Intuitive Geometry 63, 109–117 (1991)
5. de Fraysseix, H., Ossona de Mendez, P., Rosenstiehl, P.: Bipolar orientations revisited. Discrete Appl. Math. 56(2-3), 157–179 (1995)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献