Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference34 articles.
1. S. Baum, M. Stiebitz, Coloring of graphs without short odd paths between vertices of the same color class, manuscript 2005
2. Graph homomorphisms through random walks;Daneshgar;J. Graph Theory,2003
3. Graph homomorphisms and nodal domains;Daneshgar;Linear Algebra Appl.,2006
4. Density and power graphs in graph homomorphism problem;Daneshgar;Discrete Math.,2008
5. Circular colouring and algebraic no-homomorphism theorems;Daneshgar;European J. Combin.,2007
Cited by
17 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献