Author:
Bensmail Julien,Duffy Christopher,Sen Sagnik
Publisher
Springer Science and Business Media LLC
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference25 articles.
1. Alon, N., Marshall, T.H.: Homomorphisms of edge-colored graphs and Coxeter groups. J. Algebraic Comb. 8(1), 5–13 (1998)
2. Bang-Jensen, J., Hell, P., MacGillivray, G.: The complexity of colouring by semicomplete digraphs. SIAM J. Discret. Math. 1(3), 281–298 (1988)
3. Barto, L., Kozik, M., Niven, T.: The CSP dichotomy holds for digraphs with no sources and no sinks (a positive answer to a conjecture of Bang-Jensen and Hell). SIAM J. Comput. 38(5), 1782–1802 (2009)
4. Bensmail, J.: On the signed chromatic number of grids. Preprint available at
https://hal.archives-ouvertes.fr/hal-01349656/document
(2016)
5. Bensmail, J., Duvignau, R., Kirgizov, S.: The complexity of deciding whether a graph admits an orientation with fixed weak diameter. Discret. Math. Theor. Comput. Sci. 17(3), 31–42 (2016)
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献