Funder
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior
Publisher
Springer Science and Business Media LLC
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference14 articles.
1. Booth, K.S., Colbourn, C.J.: Problems polynomially equivalent to graph isomorphism. Tech. Rep. CS-77-04, University of Waterloo (1979)
2. Cappelle, M.R., Penso, L., Rautenbach, D.: Recognizing some complementary products. Theor. Comput. Sci. 521, 1–7 (2014)
3. Cerioli, M.R., Szwarcfiter, J.L.: Characterizing intersection graphs AF substars of a star. Ars Comb. 79, 21–31 (2006)
4. Chung, F.R.K.: On the cutwidth and the topological bandwidth of a tree. SIAM J. Algebr Discret Methods 6(2), 268–277 (1985)
5. Churchley, R., Huang, J.: On the polarity and monopolarity of graphs. J. Graph Theory 76(2), 138–148 (2014)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献