Topics in graph theory: Graphs and their cartesian product

Topics in Graph Theory: Graphs and Their Cartesian Product

Volumn , Issue , 2008, Pages 1-199

  Imrich, Wilfried ^a   Rall, Douglas F ^d  

^a UNIVERSITY OF LEOBEN   (Austria)

^b UNIVERSITY OF LJUBLJANA   (Slovenia)

^c UNIVERSITY OF MARIBOR   (Slovenia)

^d NONE

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84858167608     PISSN: None     EISSN: None     Source Type: Book    
DOI: None     Document Type: Book

References (122)

1. J. ADAMSSON AND R. B. RICHTER, Arrangements, circular arrangements and the crossing number of C7 × Cn, J. Combin. Theory Ser. B, 90 (2004), pp. 21-39.
2. M. O. ALBERTSON AND K. L. COLLINS, Symmetry breaking in graphs, Electron. J. Combin., 3 (1996). #R18, 17 pp.
3. N. ALON, Transversal numbers of uniform hypergraphs, Graphs Combin., 6 (1990), pp. 1-4.
4. K. APPEL AND W. HAKEN, Every planar map is four colorable, Bull. Amer. Math. Soc., 82 (1976), pp. 711-712.
5. V. I. ARNAUTOV, Estimation of the exterior stability number of a graph by means of the minimal degree of the vertices, Prikl. Mat. I Programmirovanie, (1974), pp. 3-8.
6. A. M. BARCALKIN AND L. F. GERMAN, The external stability number of the Cartesian product of graphs, Bul. Akad. Shtiintse RSS Moldoven., (1979), pp. 5-8, 94.
7. D. BARNETTE, Trees in polyhedral graphs, Canad. J. Math., 18 (1966), pp. 731-736.
8. V. BATAGELJ AND T. PISANSKI, Hamiltonian cycles in the Cartesian product of a tree and a cycle, Discrete Math., 38 (1982), pp. 311-312.
9. M. BEHZAD AND S. E. MAHMOODIAN, On topological invariants of the product of graphs, Canad. Math. Bull., 12 (1969), pp. 157-166.
10. C. BERGE, Graphs and Hypergraphs, North-Holland Publishing Co., Amsterdam, 1973. Translated from the French by Edward Minieka, North-Holland Mathematical Library, Vol. 6.
11. D. P. BIEBIGHAUSER AND M. N. ELLINGHAM, Prism-hamiltonicity of triangulations, J. Graph Theory, 57 (2008), pp. 181-197.
12. D. BOKAL, On the crossing numbers of Cartesian products with paths, J. Combin. Theory Ser. B, 97 (2007), pp. 381-384.
13. D. BOKAL, On the crossing numbers of Cartesian products with trees, J. Graph Theory, 56 (2007), pp. 287-300.
14. M. BOROWIECKI, I. BROERE, M. FRICK, P. MIHÓK, AND G. SEMANIŠIN, A survey of hereditary properties of graphs, Discuss. Math. Graph Theory, 17 (1997), pp. 5-50.
15. M. BOROWIECKI, S. JENDROL, D. KRÁL, AND J. MIŠKUF, List coloring of Cartesian products of graphs, Discrete Math., 306 (2006), pp. 1955-1958.
16. B. BREŠAR, On subgraphs of Cartesian product graphs and S-primeness, Discrete Math., 282 (2004), pp. 43-52.
17. B. BREŠAR AND B. ZMAZEK, On the independence graph of a graph, Discrete Math., 272 (2003), pp. 263-268.
18. R. L. BROOKS, On colouring the nodes of a network, Proc. Cambridge Philos. Soc., 37 (1941), pp. 194-197.
19. T. CALAMONERI, The l(h, k)-labelling problem: A survey and annotated bibliography, Computer J., 49 (2006), pp. 585-608.
20. G. CHARTRAND AND F. HARARY, Planar permutation graphs, Ann. Inst. Henri Poincaré, Nouv. Sér., Sect. B, 3 (1967), pp. 433-438.
21. X. CHEN AND J. SHEN, On the Frame-Stewart conjecture about the Towers of Hanoi, SIAM J. Comput., 33 (2004), pp. 584-589.
22. W. E. CLARK AND S. SUEN, An inequality related to Vizing;s conjecture, Electron. J. Combin., 7 (2000). #N4, 3 pp.
23. E. COCKAYNE, S. E. GOODMAN, AND S. T. HEDETNIEMI, A linear algorithm for the domination number of a tree, Inform. Process. Lett., 4 (1975), pp. 41-44.
24. K. L. COLLINS AND A. N. TRENK, The distinguishing chromatic number, Electron. J. Combin., 13 (2006). #R16, 19 pp.
25. T. H. CORMEN, C. E. LEISERSON, R. L. RIVEST, AND C. STEIN, Introduction to Algorithms, MIT Press, Cambridge, MA, second ed., 2001.
26. M. M. DEZA AND M. LAURENT, Geometry of Cuts and Metrics, vol. 15 of Algorithms and Combinatorics, Springer-Verlag, Berlin, 1997.
27. V. V. DIMAKOPOULOS, L. PALIOS, AND A. S. POULAKIDAS, On the Hamiltonicity of the Cartesian product, Inform. Process. Lett., 96 (2005), pp. 49-53.
28. G. DIRAC, Some theorems on abstract graphs, Proc. London Math. Soc., 2 (1952), pp. 68-81.
29. D. Ž. DJOKOVIĆ, Distance-preserving subgraphs of hypercubes, J. Combinatorial Theory Ser. B, 14 (1973), pp. 263-267.
30. M. EL-ZAHAR AND C. M. PAREEK, Domination number of products of graphs, Ars Combin., 31 (1991), pp. 223-227.
31. D. EPPSTEIN, Recognizing partial cubes in quadratic time. arXiv:0705.1025v1.
32. P. ERDŐS, A. L. RUBIN, AND H. TAYLOR, Choosability in graphs, in Proceedings of the West Coast Conference on Combinatorics, Graph Theory and Computing (Humboldt State Univ., Arcata, Calif., 1979), Congress. Numer., XXVI, Winnipeg, Man., 1980, Utilitas Math., pp. 125-157.
33. T. FEDER, Stable Networks and Product Graphs, Mem. Amer. Math. Soc., 116 (1995), pp. xii+223.
34. J. FEIGENBAUM, J. HERSHBERGER, AND A. A. SCHÄFFER, A polynomial time algorithm for finding the prime factors of Cartesian-product graphs, Discrete Appl. Math., 12 (1985), pp. 123-138.
35. A. FERNÁNDEZ, T. LEIGHTON, AND J. L. LÓPEZ-PRESA, Containment properties of product and power graphs, Discrete Appl. Math., 155 (2007), pp. 300-311.
36. A. FINBOW, B. HARTNELL, AND R. J. NOWAKOWSKI, A characterization of well covered graphs of girth 5 or greater, J. Combin. Theory Ser. B, 57 (1993), pp. 4468.
37. J. F. FINK, M. S. JACOBSON, L. F. KINCH, AND J. ROBERTS, On graphs having domination number half their order, Period. Math. Hungar., 16 (1985), pp. 287-293.
38. M. J. FISHER AND G. ISAAK, Distinguishing colorings of Cartesian products of complete graphs, Discrete Math., 308 (2008), pp. 2240-2246.
39. M. R. GAREY AND D. S. JOHNSON, Computers and Intractability, W. H. Freeman and Co., San Francisco, Calif., 1979.
40. J. P. GEORGES AND D. W. MAURO, Some results on λjk-numbers of the products of complete graphs, in Proceedings of the Thirtieth Southeastern International Conference on Combinatorics, Graph Theory, and Computing (Boca Raton, FL, 1999), vol. 140, 1999, pp. 141-160.
41. J. P. GEORGES, D. W. MAURO, AND M. I. STEIN, Labeling products of complete graphs with a condition at distance two, SIAM J. Discrete Math., 14 (2001), pp. 28-35.
42. J. P. GEORGES, D. W. MAURO, AND M. A. WHITTLESEY, Relating path coverings to vertex labellings with a condition at distance two, Discrete Math., 135 (1994), pp. 103-111.
43. L. Y. GLEBSKY AND G. SALAZAR, The crossing number of Cm × Cn is as conjectured for n ≥ m(m+ 1), J. Graph Theory, 47 (2004), pp. 53-72.
44. W. GODDARD AND M. HENNING, personal communication, (2003), pp. 1-2.
45. R. L. GRAHAM, On primitive graphs and optimal vertex assignments, Ann. New York Acad. Sci., 175 (1970), pp. 170-186.
46. R. L. GRAHAM AND P. M. WINKLER, On isometric embeddings of graphs, Trans. Amer. Math. Soc., 288 (1985), pp. 527-536.
47. A. GRAOVAC AND T. PISANSKI, On the Wiener index of a graph, J. Math. Chem., 8 (1991), pp. 53-62.
48. J. R. GRIGGS AND R. K. YEH, Labelling graphs with a condition at distance 2, SIAM J. Discrete Math., 5 (1992), pp. 586-595.
49. J. L. GROSS AND J. YELLEN, Graph Theory and its Applications, Discrete Mathematics and its Applications (Boca Raton), Chapman & Hall/CRC, Boca Raton, FL, second ed., 2006.
50. J. HAGAUER AND S. KLAVŽAR, On independence numbers of the Cartesian product of graphs, Ars Combin., 43 (1996), pp. 149-157.
51. F. HARARY AND L. H. HSU, Conditional chromatic number and graph operations, Bull. Inst. Math. Acad. Sinica, 19 (1991), pp. 125-134.
52. F. HARARY, P. C. KAINEN, AND A. J. SCHWENK, Toroidal graphs with arbitrarily high crossing numbers, Nanta Math., 6 (1973), pp. 58-67.
53. F. HARARY AND M. LIVINGSTON, Independent domination in hypercubes, Appl. Math. Lett., 6 (1993), pp. 27-28.
54. B. L. HARTNELL AND D. F. RALL, Vizing’s conjecture and the one-half argument, Discuss. Math. Graph Theory, 15 (1995), pp. 205-216.
55. B. L. HARTNELL AND D. F. RALL, Lower bounds for dominating Cartesian products, J. Combin. Math. Combin. Comput., 31 (1999), pp. 219-226.
56. B. L. HARTNELL AND D. F. RALL, Improving some bounds for dominating Cartesian products, Discuss. Math. Graph Theory, 23 (2003), pp. 261-272.
57. T. HAYNES, S. HEDETNIEMI, AND P. SLATER, Domination in Graphs, vol. 209 of Monographs and Textbooks in Pure and Applied Mathematics, Marcel Dekker Inc., New York, 1998.
58. S. HEDETNIEMI, Homomorphisms of graphs and automata, Doctoral Disseration, University of Michigan, (1966).
59. P. HELL, X. YU, AND H. S. ZHOU, Independence ratios of graph powers, Discrete Math., 127 (1994), pp. 213-220.
60. P. E. HIMELWRIGHT AND J. E. WILLIAMSON, On-factorability and edgecolorability of Cartesian products of graphs, Elem. Math., 29 (1974), pp. 66-67.
61. A. M. HINZ, The Tower of Hanoi, Enseign. Math. (2), 35 (1989), pp. 289-321.
62. W. IMRICH, Automorphismen und das kartesische Produkt von Graphen, Österreich. Akad. Wiss. Math.-Natur. Kl. S.-B. II, 177 (1969), pp. 203-214.
63. W. IMRICH, On products of graphs and regular groups, Israel J. Math., 11 (1972), pp. 258-264.
64. W. IMRICH, J. JEREBIC, AND S. KLAVŽAR, Distinguishing Cartesian product graphs, European J. Combin., 29 (2008), pp. 922-929.
65. W. IMRICH AND S. KLAVŽAR, A simple O(mn) algorithm for recognizing Hamming graphs, Bull. Inst. Combin. Appl., 9 (1993), pp. 45-56.
66. W. IMRICH AND S. KLAVŽAR, Product Graphs, Wiley-Interscience Series in Discrete Mathematics and Optimization, Wiley-Interscience, New York, 2000.
67. W. IMRICH AND S. KLAVŽAR, Distinguishing Cartesian powers of graphs, J. Graph Theory, 53 (2006), pp. 250260.
68. W. IMRICH, S. KLAVŽAR, AND D. F. RALL, Cancellation properties of products of graphs., Discrete Appl. Math., 155 (2007), pp. 2362-2364.
69. W. IMRICH AND I. PETERIN, Recognizing Cartesian products in linear time, Discrete Math., 307 (2007), pp. 472-483.
70. M. S. JACOBSON AND L. F. KINCH, On the domination number of products of graphs: I, Ars Combin., 18 (1984), pp. 33-44.
71. M. S. JACOBSON AND L. F. KINCH, On the domination of the products of graphs II: trees, J. Graph Theory, 10 (1986), pp. 97-106.
72. S. JENDROL’ AND M. ŠČERBOVÁ, On the crossing numbers of Sm ×Pn and Sm × Cn, Časopis Pěst. Mat., 107 (1982), pp. 225-230, 307.
73. P. K. JHA, S. KLAVŽAR, AND A. VESEL, Optimal L(d, 1)-labelings of certain direct products of cycles and Cartesian products of cycles, Discrete Appl.Math., 152 (2005), pp. 257-265.
74. P. K. JHA AND G. SLUTZKI, A note on outerplanarity of product graphs, Zastos. Mat., 21 (1993), pp. 537-544.
75. P. K. JHA AND G. SLUTZKI, Independence numbers of product graphs, Appl. Math. Lett., 7 (1994), pp. 91-94.
76. S. KLAVŽAR, Some new bounds and exact results on the independence number of Cartesian product graphs, Ars Combin., 74 (2005), pp. 173-186.
77. S. KLAVŽAR, On the canonical metric representation, average distance, and partial Hamming graphs, European J. Combin., 27 (2006), pp. 68-73.
78. S. KLAVŽAR, A. LIPOVEC, AND M. PETKOVŠEK, On subgraphs of Cartesian product graphs, Discrete Math., 244 (2002), pp. 223-230.
79. S. KLAVŽAR, U. MILUTINOVIĆ, AND C. PETR, On the Frame-Stewart algorithm for the multi-peg Tower of Hanoi problem, Discrete Appl. Math., 120 (2002), pp. 141-157.
80. S. KLAVŽAR AND I. PETERIN, Characterizing subgraphs of Hamming graphs, J. Graph Theory, 49 (2005), pp. 302-312.
81. S. KLAVŽAR, T.-L. WONG, AND X. ZHU, Distinguishing labellings of group action on vector spaces and graphs, J. Algebra, 303 (2006), pp. 626-641.
82. M. KLEŠČ, The crossing number of K2,3 × C3, Discrete Math., 251 (2002), pp. 109-117. Cycles and colourings (Stará Lesná, 1999).
83. M. KLEŠČ, Some crossing numbers of products of cycles, Discuss. Math. Graph Theory, 25 (2005), pp. 197-210.
84. M. KLEŠČ, R. B. RICHTER, AND I. STOBERT, The crossing number of C5 × Cn, J. Graph Theory, 22 (1996), pp. 239-243.
85. R. H. LAMPREY AND B. H. BARNES, A new concept of primeness in graphs, Networks, 11 (1981), pp. 279-284.
86. R. H. LAMPREY AND B. H. BARNES, A characterization of Cartesianquasiprime graphs, Congr. Numer., 109 (1995), pp. 117-121.
87. S. LANG, Algebra, vol. 211 of Graduate Texts in Mathematics, Springer-Verlag, New York, third ed., 2002.
88. B. LIOUVILLE, Sur la connectivité des produits de graphes, C. R. Acad. Sci. Paris Sér. A-B, 286 (1978), pp. A363-A365.
89. E. S. MAHMOODIAN, On edge-colorability of Cartesian products of graphs, Canad. Math. Bull., 24 (1981), pp. 107-108.
90. W. MCCUAIG AND B. SHEPHERD, Domination in graphs with minimum degree two, J. Graph Theory, 13 (1989), pp. 749-762.
91. A. MEIR AND J. W. MOON, Relations between packing and covering numbers of a tree, Pacific J. Math., 61 (1975), pp. 225-233.
92. D. J. MILLER, The automorphism group of a product of graphs, Proc. Amer. Math. Soc., 25 (1970), pp. 24-28.
93. B. MOHAR AND C. THOMASSEN, Graphs on Surfaces, Johns Hopkins Studies in the Mathematical Sciences, Johns Hopkins University Press, Baltimore, MD, 2001.
94. H. M. MULDER, The Interval Function of a Graph, vol. 132 of Mathematical Centre Tracts, Mathematisch Centrum, Amsterdam, 1980.
95. T. NAKAYAMA AND J. HASHIMOTO, On a problem of G. Birkhoff, Proc. Amer. Math. Soc., 1 (1950), pp. 141-142.
96. O. ORE, Theory of Graphs, American Mathematical Society Colloquium Publications, Vol. XXXVIII, American Mathematical Society, Providence, R.I., 1962.
97. E. M. PALMER, Prime line-graphs, Nanta Math., 6 (1973), pp. 75-76.
98. Y. H. PENG AND Y. C. YIEW, The crossing number of P(3, 1)×Pn, Discrete Math., 306 (2006), pp. 1941-1946.
99. B. REED, Paths, stars and the number three, Combin. Probab. Comput., 5 (1996), pp. 277-295.
100. R. B. RICHTER AND C. THOMASSEN, Intersections of curve systems and the crossing number of C5 × C5, Discrete Comput. Geom., 13 (1995), pp. 149-159.
101. R. D. RINGEISEN AND L. W. BEINEKE, The crossing number of C3 × Cn, J. Combin. Theory Ser. B, 24 (1978), pp. 134-136.
102. M. ROSENFELD AND D. BARNETTE, Hamiltonian circuits in certain prisms, Discrete Math., 5 (1973), pp. 389-394.
103. G. SABIDUSSI, Graphs with given group and given graph-theoretical properties, Canad. J. Math., 9 (1957), pp. 515-525.
104. G. SABIDUSSI, Graph multiplication, Math. Z., 72 (1959/1960), pp. 446-457.
105. C. SCHWARZ AND D. S. TROXELL, L(2, 1)-Labelings of Cartesian Products of Two Cycles, Discrete Appl. Math., 154 (2006), pp. 1522-1540.
106. S. ŠPACAPAN, personal communication, (2007).
107. S. ŠPACAPAN, Connectivity of Cartesian products of graphs, Appl. Math. Lett., 21 (2008), pp. 682-685.
108. C. TARDIF, A fixed box theorem for the Cartesian product of graphs and metric spaces, Discrete Math., 171 (1997), pp. 237-248.
109. W. T. TUTTE, A theorem on planar graphs, Trans. Amer. Math. Soc., 82 (1956), pp. 99-116.
110. A. VINCE, Star chromatic number, J. Graph Theory, 12 (1988), pp. 551-559.
111. V. G. VIZING, The Cartesian product of graphs, Vyčisl. Sistemy, 9 (1963), pp. 30-43.
112. V. G. VIZING, On an estimate of the chromatic class of a p-graph, Diskret. Anal., 3 (1964), pp. 25-30.
113. V. G. VIZING, Some unsolved problems in graph theory, Uspehi Mat. Nauk, 23 (1968), pp. 117-134.
114. V. G. VIZING, Coloring the vertices of a graph in prescribed colors, Diskret. Analiz, (1976), pp. 3-10, 101.
115. D. B. WEST, Introduction to Graph Theory, Second Edition, Prentice Hall Inc., Upper Saddle River, NJ, 2001.
116. H. WHITNEY, Congruent graphs and the connectivity of graphs, Amer. J. Math., 54 (1932), pp. 150-168.
117. H. WIENER, Structural determination of paraffin boiling points, J. Amer. Chem. Soc., 69 (1947), pp. 17-20.
118. P. M. WINKLER, Isometric embedding in products of complete graphs, Discrete Appl. Math., 7 (1984), pp. 221-225.
119. J.-M. XU AND C. YANG, Connectivity of Cartesian product graphs, Discrete Math., 306 (2006), pp. 159165.
120. Y. N. YEH AND I. GUTMAN, On the sum of all distances in composite graphs, Discrete Math., 135 (1994), pp. 359-365.
121. X. ZHU, Star chromatic numbers and products of graphs, J. Graph Theory, 16 (1992), pp. 557-569.
122. X. ZHU, Circular chromatic number: a survey, Discrete Math., 229 (2001), pp. 371-410.