Author:
Churchley Ross,Huang Jing,Zhu Xuding
Publisher
Springer Berlin Heidelberg
Reference9 articles.
1. Brandstädt, A.: Partitions of graphs into one or two independent sets and cliques. Discrete Math. 152, 47–54 (1986)
2. Edmonds, J.: Paths, trees, and flowers. Canad. J. Math. 17, 449–467 (1965)
3. Farrugia, A.: Vertex-partitioning into fixed additive induced-hereditary properties is NP-hard. Electron. J. Combin. 11 (2004)
4. Foldes, S., Hammer, P.L.: Split graphs. In: Proc. 8th South-Eastern Conf. on Combinatorics, Graph Theory and Computing, pp. 311–315 (1977)
5. Garey, M.R., Johnson, D.S.: Computers and Intractability. W.H. Freeman and Company, San Francisco (1979)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Domino Tatami Covering Is NP-Complete;Lecture Notes in Computer Science;2013