Funder
National Science Foundation
PRIN Italian National Research
PEPS egalite
Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference34 articles.
1. Beineke, L.W., Harary, F.: The thickness of the complete graph. Can. J. Math. 14(17), 850–859 (1965)
2. Beineke, L.W., Harary, F.: A simplified NP-complete satisfiability problem. Craig A. Tovey 8, 85–89 (1984)
3. Borradaile, G., Eppstein, D., Zhu, P.: Planar induced subgraphs of sparse graphs. In: Duncan, C.A., Symvonis, A. (eds.) Proceedings of the 22nd International Symposium on Graph Drawing (GD). Lecture Notes Comput. Sci., vol. 8871, pp. 1–12. Springer (2014)
4. Chimani, M., Derka, M., Hliněnỳ, P., Klusáček, M.: How not to characterize planar-emulable graphs. Adv. Appl. Math. 50(1), 46–68 (2013)
5. Courcelle, B.: The monadic second-order logic of graphs. I. recognizable sets of finite graphs. Inf. Comput. 85(1), 12–75 (1990)
Cited by
15 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献