Author:
Dehghan Ali,Sadeghi Mohammad-Reza,Ahadi Arash
Publisher
Springer Science and Business Media LLC
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference13 articles.
1. Bryś, K., Lonc, Z.: Polynomial cases of graph decomposition: a complete solution of Holyer’s problem. Discrete Math. 309(6), 1294–1326 (2009)
2. Dor, D., Tarsi, M.: Graph decomposition is NP-complete: a complete proof of Holyer’s conjecture. SIAM J. Comput. 26(4), 1166–1187 (1997)
3. Ganesan, A., Iyer, R.R.: The regular number of a graph. J. Discrete Math. Sci. Cryptogr. 15(2–3), 149–157 (2012)
4. Garey, M.R., Johnson, D.S.: Computers and intractability: a guide to the theory of NP-completeness. W. H. Freeman, San Francisco (1979)
5. Holyer, I.: The NP-completeness of some edge-partition problems. SIAM J. Comput. 10(4), 713–717 (1981)
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献