Author:
Hell Pavol,Nešetřil Jaroslav
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference20 articles.
1. On the complexity of colouring by tournaments and semicomplete digraphs;Bang-Jensen;SIAM J. Discrete Math.,1988
2. The effect of two cycles on the complexity of colouring by directed graphs;Bang-Jensen;Discrete Appl. Math.,1990
3. On minimal graphs;Fellner;Theoret. Comput. Sci.,1982
4. M. Fiklíová and J. Nešetřil, Density and homomorphisms, in preparation.
5. Absolute retracts in graphs;Hell,1973
Cited by
136 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Decidability of Quasi-Dense Modal Logics;Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science;2024-07-08
2. Mining Domain-Based Policies;Proceedings of the Fourteenth ACM Conference on Data and Application Security and Privacy;2024-06-19
3. Arboreal categories and equi-resource homomorphism preservation theorems;Annals of Pure and Applied Logic;2024-06
4. The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width;ACM Transactions on Algorithms;2024-05-23
5. Homomorphisms between graphs embedded in surfaces;European Journal of Combinatorics;2024-05