Table Of Content

AUTHOR INDEX 413 Journal of Graph Theory Author Index to Volume 32 Balogh, J. and Pluhar, A.: A Hakimi, S. L. and Schmeichel, Sharp Edge Bound on the Inter- E. F.: Improved Bounds for the val Number of a Graphs, 153 Chromatic Index of Graphs and Bohme, T., Harant, J., and Multigraphs, 311 Tkac, M.: On Certain Hamilto- Hammack, R.: Cyclicity of nian Cycles in Planar Graphs, 81 Graphs, 160 Bohme, T., Harant, J., and Harant, J.: See Bohme, T., 81 Tka¢, M.: More than One Harant, J.: See Bohme, T., 405 Tough Chordal Planar Graphs are Hlinény, P.: A Note of Possible Hamiltonian, 405 Extensions of Negami’s Conjec- Bohme, T., Mohar, B., and ture, 234 Stiebitz, M.: Dirac’s Map-Color Huang, L. and Chang, G. J.: Theorem for Choosability, 327 The Circular Chromatic Number Boiron, P., Sopena, E., Vignal, of the Mycielskian of G¢, 63 L.: Acyclic Improper Colorings Hudson, J. F. P.: Distinguishing of Graphs, 97 Two Graph-Encoded Manifolds of Lins, 298 Cameron, P. J.: SGDs_ with Doubly Transitive Automorph- Jelen, F: k-Independence and the ism Group, 229 k-Residue of a Graph, 241 Caro, Y. and Provstgaard, C.: Jiang, T. and West, D. B.: Color- Zero-Sum_ Delta-Systems and ing of Trees with Minimum Sum Multiple Copies of Graphs, 207 of Colors, 354 Chang, G. J.: See Huang, L., 63 Juvan, M., Mohar, B., and Chappell, G. G.: A Lower Skrekovski, R.: Graphs of De- Bound for Partial List Coverings, grees 4 are 5-Edge-Choosable, 390 250 Deng, X. and Papadimitriou, Kierstead, H. A., Sarkozy, G.N., C. H.: Exploring an Unknown and Selkow, S. M.: On k- Graph, 265 Ordered Hamiltonian Graphs, 17 Diestel, R. and Kuhn, D.: A Kuhn, D.: See Diestel, R., 191 Universal Planar Graphs under the Minor Relation, 191 Lin, I.-J., Sen, M. K., and West, Du, S.-F. and Marusic, D.: An D. B.: Intersection Representa- Infinite Family of Biprimitive tion of Digraphs in Trees with Semisymmetric Graphs, 217 Few Leaves, 340 414 JOURNAL OF GRAPH THEORY Marusi¢, D.: See Du, S.-F., 217 Schmeichel, E. F.: See Hakimi, Mohar, B.: See Juvan, M., 250 A Mohar, B.: See Bohme, T., Selkow, S. M.: See Kierstead, 327 H. A., 17 Sen, M. K.: See Lin, I.-J., 340 Papadimitriou, C. H.: See Deng, Skrekovski, R.: See Juvan, M.., X., 200 520 Piwakowski, K., KRadziszowski, Sopena, E.: See Boiron, P., 97 S. P., and Urbanski, S.: Com- Stiebitz, M.: See Bohme, T., 327 putation of the Folkman Number F,(3,3;5), 41 Tanenbaum, P. J.: Simultane- Pluhar, A.: See Balogh, J., 153 ous Intersection Representation Provstgaard, C.: See Caro, Y., of Pairs of Graphs, 171 207 Tkac, M.: See Bohme, T., 81 Tkac, M.: See Bohme, T., 405 Radziszowski, S. P.: See Pi- wakowski, K., 41 Urbanski, S.: See Piwakowski, Rizzi, R.: Indecomposable r- K., 41 Graphs and Some Other Coun- Vignal, L.: See Boiron, P., 97 terexamples, | Rusu, I.: Berge Graphs with Wagler, A.: On Critically Perfect Chordless Cycles of Bounded Graphs, 394 Length, 73 West, D. B.: See Lin, I.-J., 340 Rusu, I.: Perfectly Contractile West, D. B.: See Jiang, T., 354 Diamond-Free Graphs, 359 Yeo, A.: Hamilton Cycles, Ryjacek, Z., Saito, A., and Avoiding Prescribed Arcs, in Schelp, R. H.: Closure, 2- Close-to-Regular Tournaments, Factors, and Cycle Coverings in 123 Claw-Free Graphs, 109 Yeo, A.: Diregular c-Partite Tour- naments are Vertex-Pancyclic Saito, A.: Degree Sums and When c > 5, 137 Graphs that are not Covered by Yuster, R.: Decomposing Large Two Cycles, 51 Graphs with Small Graphs of Saito, A.: See Ryjacek, Z., 109 High Density, 27 Sarkozy, G. N.: See Kierstead, H. A., 17 Zverovich, I. E.: k-Bounded Schelp, R. H.: See Ryjacek, Z.., Classes of Dominant-Indepen- 109 dent Perfect Graphs, 303