Keyword

H-coloring

Description: A graph homomorphism problem that asks whether a graph can be mapped to a fixed target graph while preserving adjacency.
OpenAlex ID: keywords/h-coloring
1990 · Pavol Hell, Jaroslav Nešetřil · Journal of Combinatorial Theory Series B · 846
2013 · Dáaniel Marx, Barry O'sullivan, et al. · ACM Transactions on Algorithms · 146
2005 · Andrei A. Bulatov · Theoretical Computer Science · 103
2002 · Josep Díaz, Maria Serna, et al. · Theoretical Computer Science · 75
2003 · Jaroslav Nešetřil, Xuding Zhu · Journal of Combinatorial Theory Series B · 44
2006 · Martin Dyer, Leslie Ann Goldberg, et al. · The Annals of Applied Probability · 42
1996 · Jaroslav Nešetřil, Xuding Zhu · Journal of Graph Theory · 41
2007 · Fedor V. Fomin, Pinar Heggernes, et al. · Theory of Computing Systems · 39
2008 · Gábor Kun, Jaroslav Nešetřil · European Journal of Combinatorics · 38
2012 · Petr A. Golovach, Daniël Paulusma, et al. · Theoretical Computer Science · 34
2006 · Barnaby Martin, Florent Madelaine · Lecture notes in computer science · 33
2018 · Marcin Kamiński, Anna Pstrucha · Discrete Applied Mathematics · 32
2016 · Andreas Galanis, Leslie Ann Goldberg, et al. · SIAM Journal on Computing · 32
2000 · Petter Kristiansen, Jan Arne Telle · Lecture notes in computer science · 32
2019 · Bart M. P. Jansen, Astrid Pieterse · Algorithmica · 28
2012 · David Galvin · Journal of Graph Theory · 25
2012 · John Engbers, David Galvin · Journal of Combinatorial Theory Series B · 23
2001 · Colin Cooper, Martin Dyer, et al. · Journal of Algorithms · 22
2004 · Leslie Ann Goldberg, Steven Kelk, et al. · SIAM Journal on Computing · 21
2010 · Mark H. Siggers · SIAM Journal on Discrete Mathematics · 20
2002 · Paul A. Dreyer, Christopher Malon, et al. · Discrete Mathematics · 19
2015 · Victor Dalmau, Laszlo Egri, et al. · ACM/IEEE Symposium on Logic in Computer Science (LICS) · 16
2001 · Josep Díaz, Maria Serna, et al. · Lecture notes in computer science · 16
2004 · Josep Díaz, Maria Serna, et al. · Discrete Applied Mathematics · 15
Works count: 120
Citation count: 2,010
Year
Topic
Type