Skip to main content
SpringerLink
Log in

Graph homomorphisms: structure and symmetry

  • Chapter
Graph Symmetry

Part of the book series: NATO ASI Series ((ASIC,volume 497))

Abstract

This paper is the first part of an introduction to the subject of graph homomorphism in the mixed form of a course and a survey. We give the basic definitions, examples and uses of graph homomorphisms and mention some results that consider the structure and some parameters of the graphs involved. We discuss vertex-transitive graphs and Cayley graphs and their rather fundamental role in some aspects of graph homomorphisms. Graph colourings are then explored as homomorphisms, followed by a discussion of various graph products.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. H. L. Abbott, B. Zhou, The star chromatic number of a graph, J. Graph Theory 17 (1993), 349–360.

    MathSciNet  MATH  Google Scholar 

  2. M. E. Adams, J. Nesetiil, J. Sichler, Quotients of rigid graphs, J. Combin. Theory Ser. B 30 (1981), 351–359.

    MathSciNet  MATH  Google Scholar 

  3. M. O. Albertson, D. M. Berman, The chromatic difference sequence of a graph, J. Combin. Theory Ser. B 29 (1980), 1–12.

    MathSciNet  Google Scholar 

  4. M. O. Albertson, V. Booth, Homomorphisms of symmetric graphs, Congr. Numer. 53 (1986), 79–86.

    MathSciNet  Google Scholar 

  5. M. O. Albertson, K. L. Collins, Homomorphisms of 3-chromatic graphs, Discrete Math. 54 (1985), 127–132.

    MathSciNet  MATH  Google Scholar 

  6. M. O. Albertson, P. A. Catlin, L. Gibbob, Homomorphisms of 3-chromatic graphs II, Congr. Numer. 47 (1985), 19–28.

    MathSciNet  Google Scholar 

  7. L. Babai, C. Godsil, On the automorphism group of almost all Cayley graphs, European J. Comb. 3 (1982), 9–15.

    MathSciNet  MATH  Google Scholar 

  8. L. Babai, J. Nes“etfil, High chromatic rigid graphs I, in: Combinatorics (A. Hajnal, V. T. Sós, eds.), Colloq. Math. Soc. Janos Bolyai 18, North-Holland, Amsterdam, 1978, 53–60.

    Google Scholar 

  9. L. Babai, J. Nesetfil, High chromatic rigid graphs II, in: Algebraic and Geometric Combinatorics (E. Mendelsohn, ed.), Ann. Discrete Math. 15 (1982), 55–61.

    Google Scholar 

  10. H. J. Bandelt, Retracts of hypercubes, J. Graph Theory 8 (1984), 501–510.

    MathSciNet  MATH  Google Scholar 

  11. H. J. Bandelt, A. Dählmann, H. Schütte, Absolute retracts of bipartite graphs, Discrete Appl. Math. 16 (1987), 191–215.

    MathSciNet  MATH  Google Scholar 

  12. J. Bang-Jensen, P. Hell, and G. MacGillivray, The complexity of colouring by semi-complete digraphs, SIAM J. Discrete Math. 1 (1988), 281–298.

    MathSciNet  MATH  Google Scholar 

  13. J. Bang-Jensen, P. Hell, and G. MacGillivray, Hereditarily hard H-colouring problems, Discrete Math. 138 (1995), 75–92.

    MathSciNet  MATH  Google Scholar 

  14. I. BârAny, A short proof of Kneser’s conjecture, J. Combin. Theory Ser. A 25 (1978), 325–326.

    MathSciNet  MATH  Google Scholar 

  15. B. Bauslaugh, Core-like properties of infinite graphs and structures, Discrete Math. 138 (1995), 101–111.

    MathSciNet  MATH  Google Scholar 

  16. B. Bauslaugh, Homomorphisms in infinite structures, Ph. D. Thesis, Simon Fraser University, 1994.

    Google Scholar 

  17. B. Bauslaugh, The complexity of infinite H-colouring, J. Combin. Theory Ser. B 61 (1994), 141–154.

    MathSciNet  MATH  Google Scholar 

  18. J. A. Bondy, P. Hell, A note on the star chromatic number, J. Graph Theory 14 (1990), 479–482.

    MathSciNet  MATH  Google Scholar 

  19. J. A. Bondy, U. S. R. Murty, Graph Theory With Applications, Macmillan, London, 1976.

    MATH  Google Scholar 

  20. R. Brewster, G. MacGillivray, Homomorphically full graphs, Discrete Appl. Math. 66 (1996), 23–31.

    MathSciNet  MATH  Google Scholar 

  21. N. de Bruijn, P. Erdfis, A colour problem for infinite graphs and a problem in the theory of relations, Nederl. Akad. Wetensch. Proc. Ser. A 54 (1951), 371–373 ( Indag. Math. 13 ).

    Google Scholar 

  22. F. Buckley, L. Superville, The a-jointed number and graph homomorphism problems, in: The Theory and Applications of Graphs ( G. Chartrand et al., eds.), Wiley, New York, 1981, 149–158.

    Google Scholar 

  23. S. A. Burr, P. Erdös, L Lovâsz, On graphs of Ramsey type, Ars Combin. 1 (1976), 167–190.

    MATH  Google Scholar 

  24. P. Catlin, Graph homomorphisms onto the five-cycle, J. Combin. Theory Ser. B 45 (1988), 199–211.

    MathSciNet  MATH  Google Scholar 

  25. P. Catlin, Homomorphisms as generalizations of graph colouring, Congr. Numer. 50 (1985), 179–186.

    MathSciNet  Google Scholar 

  26. G. Chang, L. Huang, X. Zhu, The star-chromatic number of Mycielski’s graphs, preprint, National Sun Yat-sen University, Taiwan, 1996.

    Google Scholar 

  27. F. R. K. Chung, Z. Füredi, R. L. Graham, P. Seymour, On induced subgraphs of the cube, J. Combin. Theory Ser. A 49 (1988), 180–187.

    MathSciNet  MATH  Google Scholar 

  28. F. R. K. Chung, R. L. Graham, M. E. Saks, A dynamic location problem for graphs, Combinatorica 9 (1989), 111–131.

    MathSciNet  MATH  Google Scholar 

  29. V. Chvâtal, P. Hell, L. Kucera, J. Nes’etfil, Every finite graph is a full subgraph of a rigid graph, J. Combin. Theory 11 (1971), 284–286.

    MATH  Google Scholar 

  30. C. R. Cook, A. B. Evans, Graph folding, Congr. Numer. 23 (1979), 305–314.

    MathSciNet  Google Scholar 

  31. D. G. Corneil, A. Wagner, On the complexity of the embedding problem for hypercube related graphs, Discrete Appl. Math. 43 (1993), 75–95.

    MathSciNet  MATH  Google Scholar 

  32. W. Deuber, X. Zhu, Chromatic numbers of distance graphs, to appear in Discrete Math.

    Google Scholar 

  33. W. Deuber, X. Zhu, Relaxed coloring of a graph, to appear in Graphs and Combin.

    Google Scholar 

  34. W. Deuber, X. Zhu, Circular coloring of weighted graphs, J. Graph Theory 23 (1996), 365–376.

    MathSciNet  MATH  Google Scholar 

  35. G. A. Dirac, Homomorphism theorems for graphs, Math. Ann. 153 (1964), 69–80.

    MathSciNet  Google Scholar 

  36. D. 2. Djokovic, Distance-preserving subgraphs of hypercubes, J. Combin. Theory Ser. B 14 (1973), 263–267.

    Google Scholar 

  37. D. Duffus, I. Rival, Graphs orientable as distributive lattices, Proc. Amer. Math. Soc. 88 (1983), 197–200.

    MathSciNet  MATH  Google Scholar 

  38. D. Duffus, B. Sands, R. E. Woodrow, On the chromatic number of the product of graphs, J. Graph Theory 9 (1985), 487–495.

    MathSciNet  MATH  Google Scholar 

  39. D. Duffus, N. Sauer, Lattices arising in categorial investigations of Hedetniemi’s conjecture, Discrete Math. 152 (1996), 125–139.

    MathSciNet  MATH  Google Scholar 

  40. M. El-Zahar, N. Sauer, The chromatic number of the product of two 4-chromatic graphs is 4, Combinatorica 5 (1985), 121–126.

    MathSciNet  MATH  Google Scholar 

  41. P. Erdös, Graph theory and probability, Canad. J. Math. 11 (1959), 34–38.

    MathSciNet  MATH  Google Scholar 

  42. P. Erdös, C. Ko, R. Rado, Intersection theorems for systems of finite sets, Quart. J. Math. 12 (1961), 313–320

    Google Scholar 

  43. P. Erdös, J. Spencer, Probabilistic Methods in Combinatorics, Academic Press, New York, 1974.

    MATH  Google Scholar 

  44. O. Favaron, personal communication.

    Google Scholar 

  45. G. Gao, G. Hahn, Minimal graphs that fold onto Kn, Discrete Math. 142 (1995), 277–280.

    MathSciNet  MATH  Google Scholar 

  46. G. Gao, G. Hahn, H. Zhou, Star chromatic number of flower graphs, preprint, Université de Montréal, 1992.

    Google Scholar 

  47. G. Gao, E. Mendelsohn, H. Zhou, Computing star chromatic number from related graph invariants, J. Combin. Math. Combin. Comput. 16 (1994), 87–95.

    MathSciNet  MATH  Google Scholar 

  48. G. Gao, X. Zhu, Star-extremal graphs and lexicographic product. Discrete Math. 152 (1996), 147–156.

    MathSciNet  MATH  Google Scholar 

  49. A. H. M. Gerards, Homomorphisms of graphs into odd cycles, J. Graph Theory 12 (1988), 73–83.

    MathSciNet  MATH  Google Scholar 

  50. C. D. Godsil, Problems in algebraic combinatorics, Electron. J. Combin. 2 (1995), Feature 1, approx. 20 pp. (electronic).

    Google Scholar 

  51. W. H. Gottschalk, Choice functions and Tychonoff’s theorem, Proc. Amer. Math. Soc. 2 (1951), 172.

    MathSciNet  MATH  Google Scholar 

  52. R. L. Graham, P. M. Winkler, On isometric embeddings of graphs, Trans. Amer. Math. Soc. 288 (1985), 527–536.

    MathSciNet  MATH  Google Scholar 

  53. D. Guan, X. Zhu, A coloring problem for weighted graphs, to appear in Inform. Process. Lett.

    Google Scholar 

  54. R. Häggkvist, P. Hell, D. J. Miller, V. Neumann Lara, On multiplicative graphs and the product conjecture, Combinatorica 8 (1988), 63–74.

    MathSciNet  MATH  Google Scholar 

  55. G. Hahn, P. Hell, S. Poljak, On the ultimate independence ratio of a graph, European J. Combin. 16 (1995), 253–261.

    MathSciNet  MATH  Google Scholar 

  56. G. Hahn, G. MacGillivray, Graph homomorphisms II: Computational aspects and infinite graphs, preprint, Université de Montréal, 1997.

    Google Scholar 

  57. G. Hahn, J. Sirân, A note on intersecting cliques, J. Combin. Math. Combin. Comput. 18 (1995), 57–63.

    MathSciNet  MATH  Google Scholar 

  58. A. Hajnal, The chromatic number of the product of two N1-chromatic graphs can be countable, Combinatorica 5 (1985), 137–139.

    MathSciNet  MATH  Google Scholar 

  59. F. Harary, S. Hedetniemi, Achromatic number of a graph, J. Combin. Theory 8 (1970), 154–161.

    MathSciNet  MATH  Google Scholar 

  60. F. Harary, S. Hedetniemi, G. Prins, An interpolation theorem for graphical homomorphisms, Portugal. Math. 26 (1967), 453–462.

    MathSciNet  MATH  Google Scholar 

  61. F. Harary. D. Hsu, Z. Miller, The bichromaticity of a tree, in: Theory and Applications of Graphs (Y. Alavi, D. R. Lick, eds.), Lecture Notes in Math. 642, Springer-Verlag, Berlin, 1978, 236–246.

    Google Scholar 

  62. S. Hedetniemi, Homomorphisms of graphs and automata, University of Michigan Technical Report 03105–44-T, 1966.

    Google Scholar 

  63. Z. Hedrlín, P. Hell, C. S. Ko, Homomorphism interpolation and approximation, in: Algebraic and Geometric Combinatorics (E. Mendelsohn, ed.), Ann. Discrete Math. 15 (1982), 213–227.

    Google Scholar 

  64. P. Hell, Rigid undirected graphs with given number of vertices, Comment. Math. Univ. Carolinae 9 (1968), 51–69.

    MathSciNet  MATH  Google Scholar 

  65. P. Hell, Rétractions de graphes, Ph. D. Thesis, Université de Montréal, 1972.

    Google Scholar 

  66. P. Hell, Absolute retracts in graphs, in: Graphs and Combinatorics (R. A. Bari, F. Harary, eds.), Lecture Notes in Math. 406 (1974), 291–301.

    Google Scholar 

  67. P. Hell, An introduction to the category of graphs, Ann. N. Y. Acad. Sciences 328 (1979), 120–136.

    MathSciNet  Google Scholar 

  68. P. Hell, D. Miller, Graphs with given achromatic number, Discrete Math. 16 (1976), 195–207.

    MathSciNet  MATH  Google Scholar 

  69. P. Hell, D. Miller, On forbidden quotients and the achromatic number, in Congr. Nu-mer. 15 (1976), 283–292.

    MathSciNet  Google Scholar 

  70. P. Hell, D. Miller, Achromatic number and graph operations, Discrete Math. 108 (1992), 297–305.

    MathSciNet  MATH  Google Scholar 

  71. P. Hell, D. Miller, Graphs with forbidden homomorphic images, Ann. N. Y. Acad. Sci. 319 (1979), 270–280.

    MathSciNet  Google Scholar 

  72. P. Hell, J. Nes’etril, On the complexity of H-colourings, J. Combin. Theory Ser. B 48 (1990), 92–110.

    MathSciNet  MATH  Google Scholar 

  73. P. Hell, J. Nesetfil, The core of a graph, Discrete Math. 109 (1992), 117–126.

    MathSciNet  MATH  Google Scholar 

  74. P. Hell, J. Nes“etfil, X. Zhu, Duality of graph homomorphisms, in: Combinatorics, Paul Erdós is Eighty, vol. 2, Bolyai Society Mathematical Studies, Budapest, 1996, 271–282.

    Google Scholar 

  75. P. Hell, X. Yu, H. Zhou, Independence ratios of graph powers, Discrete Math. 127 (1994), 213–220.

    MathSciNet  MATH  Google Scholar 

  76. P. Hell, H. Zhou, X. Zhu, Homomorphisms to oriented cycles, Combinatorica 13 (1993), 421–433.

    MathSciNet  MATH  Google Scholar 

  77. P. Hell, H. Zhou, X. Zhu, Multiplicative oriented cycles, J. Combin. Theory Ser. B 60 (1994), 239–253.

    Google Scholar 

  78. P. Hell, X. Zhu, Homomorphisms to oriented paths, Discrete Math. 132 (1994) 107114.

    Google Scholar 

  79. P. Hell, X. Zhu, The existence of homomorphisms to oriented cycles, SIAM J. Discrete Math. 8 (1995), 208–222.

    MathSciNet  MATH  Google Scholar 

  80. P. Hell, H. Zhou, X. Zhu, A note on homomorphisms to acyclic local tournaments, J. Graph Theory 20 (1995), 467–471.

    MathSciNet  MATH  Google Scholar 

  81. A. J. W. Hilton, E. C. Milner, Some intersection theorems for systems of finite sets, Quart. J. Math. Oxford Ser. 2 18 (1967), 369–384.

    Google Scholar 

  82. F. Hughes, G. MacGillivray, The achromatic number of graphs: A survey and some new results, Bull. Inst. Combin. Appl. 19 (1997), 27–56.

    MathSciNet  MATH  Google Scholar 

  83. W. Imrich, J. Zerovnik, Factoring Cartesian-product graphs, J. Graph Theory 18 (1994), 557–567.

    MathSciNet  MATH  Google Scholar 

  84. W. Imrich, S. Klavzar, Retracts of strong product of graphs, Discrete Math. 109 (1992), 147–154.

    MathSciNet  MATH  Google Scholar 

  85. S. Klavzar, U. Milutinovié, Strong products of Kneser graphs, Discrete Math. 133 (1994), 297–300.

    MathSciNet  MATH  Google Scholar 

  86. A. Kostochka, E. Sopena, X. Zhu, Acyclic and oriented chromatic numbers of graphs, to appear in J. Graph Theory.

    Google Scholar 

  87. P. Kfivka, On homomorphism perfect graphs, Comment. Math. Univ. Carolinae 12 (1971), 619–626.

    Google Scholar 

  88. H. -J. Lai, Unique graph homomorphisms onto odd cycles, Utilitas Math. 31 (1987), 199–208.

    MathSciNet  MATH  Google Scholar 

  89. H. -J. Lai, Unique graph homomorphisms onto odd cycles II, J. Combin. Theory Ser. B 46 (1989), 363–376.

    MathSciNet  MATH  Google Scholar 

  90. B. Larose, F. Laviolette, C. Tardif, Normal Cayley graphs and homomorphisms of Cartesian powers of graphs, preprint, Université de Montréal, 1994,submitted to European J. Combin.

    Google Scholar 

  91. L. Lovdsz, Kneser’s conjecture, chromatic number, and homotopy, J. Combin. Theory Ser. A 25 (1978), 319–324.

    MathSciNet  Google Scholar 

  92. H. A. Maurer, A. Salomaa, E. Welzl, On the complexity of the general colouring problem, Inform. and Control 51 (1981), 128–145.

    MathSciNet  MATH  Google Scholar 

  93. H. A. Maurer, A. Salomaa, D. Wood, Colorings and interpretations: a connection between graphs and grammar forms, Discrete Appl. Math. 3 (1981), 119–135.

    MathSciNet  MATH  Google Scholar 

  94. J. Nes“ettil, Homomorphisms of derivative graphs, Discrete Math. 1 (1971), 257–268.

    MathSciNet  MATH  Google Scholar 

  95. J. Nesetfil, X. Zhu, Path homomorphisms, Math. Proc. Cambridge Philos. Soc. 120 (1996), 207–220.

    MathSciNet  Google Scholar 

  96. J. Nes’etfil, X. Zhu, On bounded treewidth duality of graphs, J. Graph Theory 23 (1996), 151–162.

    MathSciNet  Google Scholar 

  97. R. Nowakowski, I. Rival, On a class of isometric subgraphs of a graph, Combinatorica 2 (1982), 79–90.

    MathSciNet  MATH  Google Scholar 

  98. R. Nowakowski, I, Rival, The smallest graph variety containing all paths, Discrete Math. 43 (1983), 235–239.

    MathSciNet  MATH  Google Scholar 

  99. M. Perles, personal communication via P. Hell.

    Google Scholar 

  100. S. Poljak, Coloring digraphs by iterated antichains, Comment. Math. Univ. Carolinae 32 (1992), 209–212.

    Google Scholar 

  101. S. Poljak, V. Rödl, On the arc-chromatic number of a digraph, J. Combin. Theory Ser. B 31 (1981), 190–198.

    MathSciNet  MATH  Google Scholar 

  102. A. Pultr, V. Trnkovâ, Combinatorial, Algebraic and Topological Representations of Groups, Semigroups and Categories, North-Holland, Amsterdam, 1980.

    Google Scholar 

  103. A. Quilliot, Un problème de point fixe sur les graphes, Ann. Rev. Inst. Mat. Mexico, 1981.

    Google Scholar 

  104. A. Quilliot, On the Helly property working as a compactness criterion on graphs, J. Combin. Theory Ser. A 40 (1985), 186–193.

    MathSciNet  MATH  Google Scholar 

  105. I. Rival, Maximal sublattices of finite distributive lattices, Proc. Amer. Math. Soc: 37 (1973), 417–420.

    MathSciNet  MATH  Google Scholar 

  106. J. Rotman, The Theory of Groups, Allyn and Bacon, Boston, 1973.

    MATH  Google Scholar 

  107. G. Sabidussi, Graphs with given group and given graph-theoretical properties, Canad. J. Math. 9 (1957), 515–525.

    MathSciNet  MATH  Google Scholar 

  108. G. Sabidussi, Vertex-transitive graphs, Monatsh. Math. 68 (1964), 426–438.

    Google Scholar 

  109. G. Sabidussi, Graph derivatives, Math. Z. 76 (1961), 385–401.

    MathSciNet  MATH  Google Scholar 

  110. N. Sauer, X. Zhu, An approach to Hedetniemi’s conjecture, J. Graph Theory 16 (1992), 423–436.

    MathSciNet  MATH  Google Scholar 

  111. N. Sauer, X. Zhu, Multiplicative posets, Order 8 (1992), 349–358.

    Google Scholar 

  112. H. Shapiro, The embedding of graphs in cubes and the design of sequential relay circuits, Bell Telephone Laboratories Memorandum, 1953.

    Google Scholar 

  113. S. Stahl, n-tuple colorings and associated graphs, J. Combin. Theory Ser. B 20 (1976), 185–203.

    Google Scholar 

  114. S. Stahl, The multichromatic numbers of some Kneser graphs, preprint, University of Kansas, 1996.

    Google Scholar 

  115. E. Steffen, X. Zhu, Star chromatic numbers of graphs, Combinatorica 16 (1996), 439448.

    Google Scholar 

  116. L. Szamkolowicz, Remarks on the Cartesian product of two graphs, Colloq. Math. 9 (1962), 43–47.

    MathSciNet  MATH  Google Scholar 

  117. C. Tardif, A fixed box theorem for the cartesian product of graphs and metric spaces, to appear in Discrete Math.

    Google Scholar 

  118. C. Tardif, Fractional multiples of graphs and the density of vertex-transitive graphs, preprint, Université de Montréal, 1996.

    Google Scholar 

  119. C. Tardif, Graph products and the chromatic difference sequence of vertex transitive graphs, preprint, Université de Montréal, 1996.

    Google Scholar 

  120. C. Tardif, Homomorphismes du graphe de Petersen et inégalités combinatoires, preprint, Université de Montréal, 1996.

    Google Scholar 

  121. B. Toft, Graph Colouring Problems, Wiley-Intersci. Ser. Discrete Math. Optim., Wiley, New York, 1995.

    Google Scholar 

  122. J. Turner, Point-symmetric graphs with a prime number of points, J. Combin. Theory Ser. B 3 (1967), 136–145.

    MATH  Google Scholar 

  123. D. Turzik, A note on chromatic number of direct product of graphs, Comment. Math. Univ. Carolinae 24 (1983), 461–463.

    MathSciNet  MATH  Google Scholar 

  124. K. Vesztergombi, Chromatic number of strong products of graphs, in: Algebraic Methods in Graph Theory, vol. 2 (L. Lovâsz, V. T. Sós, eds.), Colloq. Math. Soc. Janos Bolyai 25, North-Holland, Amsterdam, 1981, 819–825.

    Google Scholar 

  125. A. Vince, Star chromatic number, J. Graph Theory 12 (1988), 551–559.

    MathSciNet  MATH  Google Scholar 

  126. J. Walker, From graphs to ortholattices and equivariant maps, J. Combin. Theory Ser. B 35 (1983), 171–192.

    MathSciNet  MATH  Google Scholar 

  127. E. Welzl, Color-families are dense, J. Theoret. Comput. Sci. 17 (1982), 29–41.

    MathSciNet  MATH  Google Scholar 

  128. E. Welzl, Symmetric graphs and interpretations, J. Combin. Theory Ser. B 37 (1984), 235–244.

    MathSciNet  MATH  Google Scholar 

  129. E. Wilkeit, The retracts of Hamming graphs, Discrete Math. 102 (1992), 197–218.

    MathSciNet  MATH  Google Scholar 

  130. B. Zelinka, Homomorphisms of finite bipartite graphs onto complete bipartite graphs, Math. Slovaca 33 (1983), 545–547.

    Google Scholar 

  131. B. Zelinka, Homomorphisms of infinite bipartite graphs onto complete bipartite graphs, Czechoslovak Math. J. 32 (1982), 361–366.

    MathSciNet  MATH  Google Scholar 

  132. H. Zhou, Chromatic difference sequences and homomorphisms, Discrete Math. 113 (1993), 285–292.

    MathSciNet  MATH  Google Scholar 

  133. H. Zhou, The chromatic difference sequence of the cartesian product of graphs, Discrete Math. 90 (1991), 297–311.

    MathSciNet  MATH  Google Scholar 

  134. H. Zhou, The chromatic difference sequence of the cartesian product of graphs: Part II, Discrete Appl. Math. 41 (1993), 263–267.

    MathSciNet  MATH  Google Scholar 

  135. H. Zhou, Homomorphism properties of graphs, Ph. D. Thesis, Simon Fraser University, 1988.

    Google Scholar 

  136. H. Zhou, X. Zhu, On the multiplicativity of acyclic local tournaments, to appear in Combinatorica.

    Google Scholar 

  137. X. Zhu, On the bounds for the ultimate independence ratio of graphs, Discrete Math. 156 (1996), 207–220.

    Google Scholar 

  138. X. Zhu, Star chromatic numbers and products of graphs, J. Graph Theory 16 (1992), 557–569.

    MathSciNet  MATH  Google Scholar 

  139. X. Zhu, On the chromatic number of the products of hypergraphs Ars Combin. 34 (1992), 25–31.

    MathSciNet  MATH  Google Scholar 

  140. X. Zhu, A simple proof of the multiplicativity of directed cycles of prime power length, Discrete Appi. Math. 36 (1992), 313–315.

    MATH  Google Scholar 

  141. X. Zhu, A note on graph reconstruction, to appear in Ars Combinatoria.

    Google Scholar 

  142. X. Zhu, Circular chromatic number a survey, preprint, National Sun Yat-sen University, Taiwan, 1997.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Département d’informatique et de recherche opérationnelle, C.P. 6128, succursale Centre-ville, Montréal, Québec, H3C 3J7, Canada

    Geňa Hahn

  2. Département de mathématiques et de statistique, Université de Montréal, C.P. 6128, succursale Centre-ville, Montréal, Québec, H3C 3J7, Canada

    Claude Tardif

Authors
  1. Geňa Hahn
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Claude Tardif
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Départment d’Informatique et de Recherche opérationnelle, Université de Montréal, CP 6128, Succ. Centre-ville, H3C 3J7, Montréal, Québec, Canada

    Geňa Hahn

  2. Départment de Mathématiques et de Statistique, Université de Montréal, CP 6128, Succ. Centre-ville, H3C 3J7, Montréal, Québec, Canada

    Gert Sabidussi

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer Science+Business Media Dordrecht

About this chapter

Cite this chapter

Hahn, G., Tardif, C. (1997). Graph homomorphisms: structure and symmetry. In: Hahn, G., Sabidussi, G. (eds) Graph Symmetry. NATO ASI Series, vol 497. Springer, Dordrecht. https://doi.org/10.1007/978-94-015-8937-6_4

Download citation

  • DOI: https://doi.org/10.1007/978-94-015-8937-6_4

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-90-481-4885-1

  • Online ISBN: 978-94-015-8937-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation