Graph homomorphism (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Graph homomorphism" in English language version.

refsWebsite

Global rank English rank

36sfu.ca

3,413^th place

2,445^th place

23doi.org

2^nd place

13web.archive.org

1^st place

10queensu.ca

6,111^th place

3,868^th place

5qmul.ac.uk

1,735^th place

3,129^th place

5semanticscholar.org

11^th place

8^th place

2arxiv.org

69^th place

59^th place

2amsi.org.au

low place

1uwaterloo.ca

3,153^rd place

2,332^nd place

1ams.org

451^st place

277^th place

1combinatorics.org

low place

1wolfram.com

513^th place

537^th place

1tu-dresden.de

low place

1stanford.edu

179^th place

183^rd place

ams.org

mathscinet.ams.org

Tardif, C. (2008), "Hedetniemi's conjecture, 40 years later" (PDF), Graph Theory Notes of New York, 54: 46–57, MR 2445666, archived from the original (PDF) on 2021-07-12, retrieved 2017-08-05.

amsi.org.au

vrs.amsi.org.au

Gray 2014, Lemma 3.7. Gray, Charles T. (2014), The Digraph Lattice (PDF) (AMSI Vacation Research Scholarships Archived 2018-08-14 at the Wayback Machine, student research report supervised by Brian Davey and Jane Pitkethly, La Trobe University).
Gray 2014. Gray, Charles T. (2014), The Digraph Lattice (PDF) (AMSI Vacation Research Scholarships Archived 2018-08-14 at the Wayback Machine, student research report supervised by Brian Davey and Jane Pitkethly, La Trobe University).

arxiv.org

Kwuida, Léonard; Lehtonen, Erkko (2011), "On the Homomorphism Order of Labeled Posets", Order, 28 (2): 251–265, arXiv:0911.0200, doi:10.1007/s11083-010-9169-x, S2CID 14920600
Cygan, Marek; Fomin, Fedor V.; Golovnev, Alexander; Kulikov, Alexander S.; Mihajlin, Ivan; Pachocki, Jakub; Socala, Arkadiusz (2016), "Tight bounds for graph homomorphism and subgraph isomorphism", in Krauthgamer, Robert (ed.), Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, January 10–12, 2016, Society for Industrial and Applied Mathematics, pp. 1643–1649, arXiv:1507.03738, doi:10.1137/1.9781611974331.ch112, ISBN 978-1-611974-33-1

combinatorics.org

Brown et al. 2008. Brown, Ronald; Morris, Ifor; Shrimpton, John; Wensley, Christopher D. (2008), "Graphs of morphisms of graphs", Electronic Journal of Combinatorics, 15 (1): A1, doi:10.37236/919

doi.org

Hell & Nešetřil 2008. Hell, Pavol; Nešetřil, Jaroslav (2008), "Colouring, constraint satisfaction, and complexity" (PDF), Computer Science Review, 2 (3): 143–163, doi:10.1016/j.cosrev.2008.10.003, archived from the original (PDF) on 2017-07-06, retrieved 2017-04-09
For introductions, see (in order of increasing length): Cameron (2006); Hahn & Tardif (1997); Hell & Nešetřil (2004). Cameron, Peter (2006), Graph Homomorphisms, Combinatorics Study Group Notes (PDF) Hahn, Geňa; Tardif, Claude (1997), "Graph homomorphisms: structure and symmetry", Graph Symmetry: Algebraic Methods and Applications (PDF), Springer, pp. 107–166, doi:10.1007/978-94-015-8937-6_4, ISBN 978-90-481-4885-1, archived from the original (PDF) on 2021-07-11, retrieved 2017-04-09 Hell, Pavol; Nešetřil, Jaroslav (2004), Graphs and Homomorphisms, Oxford Lecture Series in Mathematics and Its Applications, vol. 28, Oxford University Press, ISBN 0-19-852817-5
Hahn & Tardif 1997, Observation 2.3. Hahn, Geňa; Tardif, Claude (1997), "Graph homomorphisms: structure and symmetry", Graph Symmetry: Algebraic Methods and Applications (PDF), Springer, pp. 107–166, doi:10.1007/978-94-015-8937-6_4, ISBN 978-90-481-4885-1, archived from the original (PDF) on 2021-07-11, retrieved 2017-04-09
Godsil & Royle 2001, p. 115. Godsil, Chris; Royle, Gordon (2001), "6. Homomorphisms", Algebraic Graph Theory, Graduate Texts in Mathematics, vol. 207, Springer–Verlag New York, doi:10.1007/978-1-4613-0163-9, ISBN 978-1-4613-0163-9, S2CID 9661174
Hell & Nešetřil 2004, §6.1; Hahn & Tardif 1997, §4.4. Hell, Pavol; Nešetřil, Jaroslav (2004), Graphs and Homomorphisms, Oxford Lecture Series in Mathematics and Its Applications, vol. 28, Oxford University Press, ISBN 0-19-852817-5 Hahn, Geňa; Tardif, Claude (1997), "Graph homomorphisms: structure and symmetry", Graph Symmetry: Algebraic Methods and Applications (PDF), Springer, pp. 107–166, doi:10.1007/978-94-015-8937-6_4, ISBN 978-90-481-4885-1, archived from the original (PDF) on 2021-07-11, retrieved 2017-04-09
Hell & Nešetřil 2004, §6.2; Hahn & Tardif 1997, §4.5. Hell, Pavol; Nešetřil, Jaroslav (2004), Graphs and Homomorphisms, Oxford Lecture Series in Mathematics and Its Applications, vol. 28, Oxford University Press, ISBN 0-19-852817-5 Hahn, Geňa; Tardif, Claude (1997), "Graph homomorphisms: structure and symmetry", Graph Symmetry: Algebraic Methods and Applications (PDF), Springer, pp. 107–166, doi:10.1007/978-94-015-8937-6_4, ISBN 978-90-481-4885-1, archived from the original (PDF) on 2021-07-11, retrieved 2017-04-09
Fiala, J.; Kratochvíl, J. (2002), "Partial covers of graphs", Discussiones Mathematicae Graph Theory, 22 (1): 89–99, doi:10.7151/dmgt.1159, S2CID 17507393
Hell & Nešetřil 2004, Theorem 3.30; Hahn & Tardif 1997, Theorem 2.33. Hell, Pavol; Nešetřil, Jaroslav (2004), Graphs and Homomorphisms, Oxford Lecture Series in Mathematics and Its Applications, vol. 28, Oxford University Press, ISBN 0-19-852817-5 Hahn, Geňa; Tardif, Claude (1997), "Graph homomorphisms: structure and symmetry", Graph Symmetry: Algebraic Methods and Applications (PDF), Springer, pp. 107–166, doi:10.1007/978-94-015-8937-6_4, ISBN 978-90-481-4885-1, archived from the original (PDF) on 2021-07-11, retrieved 2017-04-09
Welzl, E. (1982), "Color-families are dense", Theoretical Computer Science, 17: 29–41, doi:10.1016/0304-3975(82)90129-3
Hell & Nešetřil 2004, p. 192; Hahn & Tardif 1997, p. 127. Hell, Pavol; Nešetřil, Jaroslav (2004), Graphs and Homomorphisms, Oxford Lecture Series in Mathematics and Its Applications, vol. 28, Oxford University Press, ISBN 0-19-852817-5 Hahn, Geňa; Tardif, Claude (1997), "Graph homomorphisms: structure and symmetry", Graph Symmetry: Algebraic Methods and Applications (PDF), Springer, pp. 107–166, doi:10.1007/978-94-015-8937-6_4, ISBN 978-90-481-4885-1, archived from the original (PDF) on 2021-07-11, retrieved 2017-04-09
Hell & Nešetřil 2004, Proposition 3.2, distributivity is stated in Proposition 2.4; Hahn & Tardif 1997, Theorem 2.37. Hell, Pavol; Nešetřil, Jaroslav (2004), Graphs and Homomorphisms, Oxford Lecture Series in Mathematics and Its Applications, vol. 28, Oxford University Press, ISBN 0-19-852817-5 Hahn, Geňa; Tardif, Claude (1997), "Graph homomorphisms: structure and symmetry", Graph Symmetry: Algebraic Methods and Applications (PDF), Springer, pp. 107–166, doi:10.1007/978-94-015-8937-6_4, ISBN 978-90-481-4885-1, archived from the original (PDF) on 2021-07-11, retrieved 2017-04-09
Kwuida, Léonard; Lehtonen, Erkko (2011), "On the Homomorphism Order of Labeled Posets", Order, 28 (2): 251–265, arXiv:0911.0200, doi:10.1007/s11083-010-9169-x, S2CID 14920600
Duffus, D.; Sauer, N. (1996), "Lattices arising in categorial investigations of Hedetniemi's conjecture", Discrete Mathematics, 152 (1–3): 125–139, doi:10.1016/0012-365X(94)00298-W
Brown et al. 2008. Brown, Ronald; Morris, Ifor; Shrimpton, John; Wensley, Christopher D. (2008), "Graphs of morphisms of graphs", Electronic Journal of Combinatorics, 15 (1): A1, doi:10.37236/919
Hahn & Tardif 1997, Observation 2.6. Hahn, Geňa; Tardif, Claude (1997), "Graph homomorphisms: structure and symmetry", Graph Symmetry: Algebraic Methods and Applications (PDF), Springer, pp. 107–166, doi:10.1007/978-94-015-8937-6_4, ISBN 978-90-481-4885-1, archived from the original (PDF) on 2021-07-11, retrieved 2017-04-09
Hahn & Tardif 1997, Proposition 3.14. Hahn, Geňa; Tardif, Claude (1997), "Graph homomorphisms: structure and symmetry", Graph Symmetry: Algebraic Methods and Applications (PDF), Springer, pp. 107–166, doi:10.1007/978-94-015-8937-6_4, ISBN 978-90-481-4885-1, archived from the original (PDF) on 2021-07-11, retrieved 2017-04-09
Gyárfás, A.; Jensen, T.; Stiebitz, M. (2004), "On Graphs With Strongly Independent Color-Classes", Journal of Graph Theory, 46 (1): 1–14, doi:10.1002/jgt.10165, S2CID 17859655
Hell, Pavol; Nešetřil, Jaroslav (1990), "On the complexity of H-coloring", Journal of Combinatorial Theory, Series B, 48 (1): 92–110, doi:10.1016/0095-8956(90)90132-J
Feder, Tomás; Vardi, Moshe Y. (1998), "The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory", SIAM Journal on Computing, 28 (1): 57–104, doi:10.1137/S0097539794266766
Cygan, Marek; Fomin, Fedor V.; Golovnev, Alexander; Kulikov, Alexander S.; Mihajlin, Ivan; Pachocki, Jakub; Socala, Arkadiusz (2016), "Tight bounds for graph homomorphism and subgraph isomorphism", in Krauthgamer, Robert (ed.), Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, January 10–12, 2016, Society for Industrial and Applied Mathematics, pp. 1643–1649, arXiv:1507.03738, doi:10.1137/1.9781611974331.ch112, ISBN 978-1-611974-33-1
Dalmau, Víctor; Kolaitis, Phokion G.; Vardi, Moshe Y. (2002), "Constraint satisfaction, bounded treewidth, and finite-variable logics", in Van Hentenryck, Pascal (ed.), Principles and Practice of Constraint Programming – CP 2002, 8th International Conference, CP 2002, Ithaca, NY, USA, September 9–13, 2002, Proceedings, Lecture Notes in Computer Science, vol. 2470, Springer, pp. 310–326, doi:10.1007/3-540-46135-3_21, ISBN 978-3-540-44120-5
Grohe, Martin (2007), "The complexity of homomorphism and constraint satisfaction problems seen from the other side", Journal of the ACM, 54 (1): 1–es, doi:10.1145/1206035.1206036, S2CID 11797906
Marx, Dániel (2010), "Can You Beat Treewidth?", Theory of Computing, 6: 85–112, doi:10.4086/toc.2010.v006a005

qmul.ac.uk

maths.qmul.ac.uk

For introductions, see (in order of increasing length): Cameron (2006); Hahn & Tardif (1997); Hell & Nešetřil (2004). Cameron, Peter (2006), Graph Homomorphisms, Combinatorics Study Group Notes (PDF) Hahn, Geňa; Tardif, Claude (1997), "Graph homomorphisms: structure and symmetry", Graph Symmetry: Algebraic Methods and Applications (PDF), Springer, pp. 107–166, doi:10.1007/978-94-015-8937-6_4, ISBN 978-90-481-4885-1, archived from the original (PDF) on 2021-07-11, retrieved 2017-04-09 Hell, Pavol; Nešetřil, Jaroslav (2004), Graphs and Homomorphisms, Oxford Lecture Series in Mathematics and Its Applications, vol. 28, Oxford University Press, ISBN 0-19-852817-5
Cameron 2006, Proposition 2.3; Hell & Nešetřil 2004, Corollary 1.32. Cameron, Peter (2006), Graph Homomorphisms, Combinatorics Study Group Notes (PDF) Hell, Pavol; Nešetřil, Jaroslav (2004), Graphs and Homomorphisms, Oxford Lecture Series in Mathematics and Its Applications, vol. 28, Oxford University Press, ISBN 0-19-852817-5
Cameron 2006, p. 4, Proposition 2.5. Cameron, Peter (2006), Graph Homomorphisms, Combinatorics Study Group Notes (PDF)
Cameron 2006, p. 1; Hell & Nešetřil 2004, Proposition 1.7. Cameron, Peter (2006), Graph Homomorphisms, Combinatorics Study Group Notes (PDF) Hell, Pavol; Nešetřil, Jaroslav (2004), Graphs and Homomorphisms, Oxford Lecture Series in Mathematics and Its Applications, vol. 28, Oxford University Press, ISBN 0-19-852817-5
Cameron 2006, p. 1. Cameron, Peter (2006), Graph Homomorphisms, Combinatorics Study Group Notes (PDF)

queensu.ca

mast.queensu.ca

For introductions, see (in order of increasing length): Cameron (2006); Hahn & Tardif (1997); Hell & Nešetřil (2004). Cameron, Peter (2006), Graph Homomorphisms, Combinatorics Study Group Notes (PDF) Hahn, Geňa; Tardif, Claude (1997), "Graph homomorphisms: structure and symmetry", Graph Symmetry: Algebraic Methods and Applications (PDF), Springer, pp. 107–166, doi:10.1007/978-94-015-8937-6_4, ISBN 978-90-481-4885-1, archived from the original (PDF) on 2021-07-11, retrieved 2017-04-09 Hell, Pavol; Nešetřil, Jaroslav (2004), Graphs and Homomorphisms, Oxford Lecture Series in Mathematics and Its Applications, vol. 28, Oxford University Press, ISBN 0-19-852817-5
Hahn & Tardif 1997, Observation 2.3. Hahn, Geňa; Tardif, Claude (1997), "Graph homomorphisms: structure and symmetry", Graph Symmetry: Algebraic Methods and Applications (PDF), Springer, pp. 107–166, doi:10.1007/978-94-015-8937-6_4, ISBN 978-90-481-4885-1, archived from the original (PDF) on 2021-07-11, retrieved 2017-04-09
Hell & Nešetřil 2004, §6.1; Hahn & Tardif 1997, §4.4. Hell, Pavol; Nešetřil, Jaroslav (2004), Graphs and Homomorphisms, Oxford Lecture Series in Mathematics and Its Applications, vol. 28, Oxford University Press, ISBN 0-19-852817-5 Hahn, Geňa; Tardif, Claude (1997), "Graph homomorphisms: structure and symmetry", Graph Symmetry: Algebraic Methods and Applications (PDF), Springer, pp. 107–166, doi:10.1007/978-94-015-8937-6_4, ISBN 978-90-481-4885-1, archived from the original (PDF) on 2021-07-11, retrieved 2017-04-09
Hell & Nešetřil 2004, §6.2; Hahn & Tardif 1997, §4.5. Hell, Pavol; Nešetřil, Jaroslav (2004), Graphs and Homomorphisms, Oxford Lecture Series in Mathematics and Its Applications, vol. 28, Oxford University Press, ISBN 0-19-852817-5 Hahn, Geňa; Tardif, Claude (1997), "Graph homomorphisms: structure and symmetry", Graph Symmetry: Algebraic Methods and Applications (PDF), Springer, pp. 107–166, doi:10.1007/978-94-015-8937-6_4, ISBN 978-90-481-4885-1, archived from the original (PDF) on 2021-07-11, retrieved 2017-04-09
Hell & Nešetřil 2004, Theorem 3.30; Hahn & Tardif 1997, Theorem 2.33. Hell, Pavol; Nešetřil, Jaroslav (2004), Graphs and Homomorphisms, Oxford Lecture Series in Mathematics and Its Applications, vol. 28, Oxford University Press, ISBN 0-19-852817-5 Hahn, Geňa; Tardif, Claude (1997), "Graph homomorphisms: structure and symmetry", Graph Symmetry: Algebraic Methods and Applications (PDF), Springer, pp. 107–166, doi:10.1007/978-94-015-8937-6_4, ISBN 978-90-481-4885-1, archived from the original (PDF) on 2021-07-11, retrieved 2017-04-09
Hell & Nešetřil 2004, p. 192; Hahn & Tardif 1997, p. 127. Hell, Pavol; Nešetřil, Jaroslav (2004), Graphs and Homomorphisms, Oxford Lecture Series in Mathematics and Its Applications, vol. 28, Oxford University Press, ISBN 0-19-852817-5 Hahn, Geňa; Tardif, Claude (1997), "Graph homomorphisms: structure and symmetry", Graph Symmetry: Algebraic Methods and Applications (PDF), Springer, pp. 107–166, doi:10.1007/978-94-015-8937-6_4, ISBN 978-90-481-4885-1, archived from the original (PDF) on 2021-07-11, retrieved 2017-04-09
Hell & Nešetřil 2004, Proposition 3.2, distributivity is stated in Proposition 2.4; Hahn & Tardif 1997, Theorem 2.37. Hell, Pavol; Nešetřil, Jaroslav (2004), Graphs and Homomorphisms, Oxford Lecture Series in Mathematics and Its Applications, vol. 28, Oxford University Press, ISBN 0-19-852817-5 Hahn, Geňa; Tardif, Claude (1997), "Graph homomorphisms: structure and symmetry", Graph Symmetry: Algebraic Methods and Applications (PDF), Springer, pp. 107–166, doi:10.1007/978-94-015-8937-6_4, ISBN 978-90-481-4885-1, archived from the original (PDF) on 2021-07-11, retrieved 2017-04-09
Tardif, C. (2008), "Hedetniemi's conjecture, 40 years later" (PDF), Graph Theory Notes of New York, 54: 46–57, MR 2445666, archived from the original (PDF) on 2021-07-12, retrieved 2017-08-05.
Hahn & Tardif 1997, Observation 2.6. Hahn, Geňa; Tardif, Claude (1997), "Graph homomorphisms: structure and symmetry", Graph Symmetry: Algebraic Methods and Applications (PDF), Springer, pp. 107–166, doi:10.1007/978-94-015-8937-6_4, ISBN 978-90-481-4885-1, archived from the original (PDF) on 2021-07-11, retrieved 2017-04-09
Hahn & Tardif 1997, Proposition 3.14. Hahn, Geňa; Tardif, Claude (1997), "Graph homomorphisms: structure and symmetry", Graph Symmetry: Algebraic Methods and Applications (PDF), Springer, pp. 107–166, doi:10.1007/978-94-015-8937-6_4, ISBN 978-90-481-4885-1, archived from the original (PDF) on 2021-07-11, retrieved 2017-04-09

semanticscholar.org

api.semanticscholar.org

Godsil & Royle 2001, p. 115. Godsil, Chris; Royle, Gordon (2001), "6. Homomorphisms", Algebraic Graph Theory, Graduate Texts in Mathematics, vol. 207, Springer–Verlag New York, doi:10.1007/978-1-4613-0163-9, ISBN 978-1-4613-0163-9, S2CID 9661174
Fiala, J.; Kratochvíl, J. (2002), "Partial covers of graphs", Discussiones Mathematicae Graph Theory, 22 (1): 89–99, doi:10.7151/dmgt.1159, S2CID 17507393
Kwuida, Léonard; Lehtonen, Erkko (2011), "On the Homomorphism Order of Labeled Posets", Order, 28 (2): 251–265, arXiv:0911.0200, doi:10.1007/s11083-010-9169-x, S2CID 14920600
Gyárfás, A.; Jensen, T.; Stiebitz, M. (2004), "On Graphs With Strongly Independent Color-Classes", Journal of Graph Theory, 46 (1): 1–14, doi:10.1002/jgt.10165, S2CID 17859655
Grohe, Martin (2007), "The complexity of homomorphism and constraint satisfaction problems seen from the other side", Journal of the ACM, 54 (1): 1–es, doi:10.1145/1206035.1206036, S2CID 11797906