Table Of Content

AUTHOR INDEX 329 Journal of Graph Theory Author Index to Volume 43 Alon, N., Krivelevich, M., and meyer, I[.: Two-Factors Each Sudakov, B.: Induced Subgraphs Component of Which Contains a of Prescribed Size, 239 Specified Vertex, 188 Bell, F.K.: Line Graphs of Bipar- El-Batanouny, S.: See Caccetta, tite Graphs with Hamiltonian Ly. 7 Paths, 137 Enomoto, H.: See Egawa, Y., 188 Bénard, D., Bouchet, A., and Faudree, R.J.: See Egawa, Y., 188 Richter, R.B.: Fold-2-Covering Fiala, J.: NP Completeness of the Triangular Embeddings, 79 Edge Precoloring Extension Pro- Berg, A.R., Jackson, B., and blem on Bipartite Graphs, 156 Jordan, T.: Highly Edge-Con- Fiol, M.A., Gimbert, J., Gomez, nected Detatchments of Graphs J., and Wu, Y.: On Moore Bipar- and Digraphs, 67 tite Digraphs, 171 Birmele, E.: Tree-Width and Cir- Foisy, J.: A Newly Recognized cumference of Graphs, 24 Intrinsically Knotted Graph, 199 Bonato, A. and Tardif, C.: Large Gimbert, J.: See Fiol, M.A., 171 Families of Mutually Emeddable Gomez, J.: See Fiol, M.A., 171 Vertex-Transitive Graphs, 99 Grigorescu, E.: Decreasing the Bouchet, A.: See Bénard, D., 79 Diameter of Cycles, 299 Caccetta, L., El-Batanouny, S., Hilton, A.J.W. and Jonson, M.: and Huang, J.: On Vertex Critical An Algorithm for Finding Factor- Graphs with Prescribed Diameter, izations of Complete Graphs, 132 117 Huh, Y. and Oh, S.: Planar Graphs Daven, M., MacDougall, J.A., Producing No Strongly Almost and Rodger, C.A.: Maximal Sets trivial Embedding, 319 of Hamilton Cycles in Complete Imrich, W. and Skrekovski, R.: A Multipartite Graphs, 49 Theorem on Integer Flows on Egawa, Y., Enomoto, H., Fau- Cartesian Products of Graphs, 93 dree, R.J., Li, H., and Schier- Huang, J.: See Caccetta, L., 117 330 AUTHOR INDEX Jackson, B.: See Berg, A.R., 67 Nelson, D.A.: The Structure of Jiang, T., Kim, S.-J., and West, Saturated Critical Block, 223 D.B.: Isometric Cycles, Cutsets, Oh, S.: See Huh, Y., 319 and Crowning of Bridged Graphs, Ota, K.: See Kawarabayashi, K.., 161 26 Johnson, M.: See Hilton, A.J.W., Polat, N.: On Constructible 132 Graphs, Locally Helly Graphs, Jordan, T.: See Berg, A.R., 67 and Convexity, 280 Kawarabayashi, K., Nakamoto, Pan, Z. and Zhu. X.: Construction A., and Ota, K.: 2-Connected 7- of Graphs with Given Circular Coverings of 3-Connected Graphs Numbers, 304 on Surfaces, 26 Richter, R.B.: See Bénard, D., Kaneko, A. and Yoshimoto, K.: A 79 2-Factor with Two Components of Rodger, C.A.: See Daven, M., 49 a Graph Satisfying the Chvatal- Ryjatek, Z., and Schelp, R.H.: Erd6s Condition, 269 Contractibility Techniques as a Kim, S.-J.: See Jiang, T., 161 Closure Concept, 37 Krivelevich, M.: See Alon, N., Schelp, R.H.: See Ryjacek, Z., 37 239 Schiermeyer, I.: See Egawa, Y., Li, H.: See Egawa, Y., 188 188 Li, X and Zhang, C.-Q.: Chords Skrekovski, R.: See Imrich, W., of Longest Circuits of Graphs 93 Embedded in Torus and Klein Stadler, P.F.: Minimum Cycle Bottle, 1 Bases of Halin Graphs, 150 Lortz, R. and Mengersen, LI.: Sudakov, B.: See Alon, N., 239 Off-Diagonal and Assymptotic Tardif, C.: See Bonato, A., 99 Results on the Ramsey Number Tomescu, I.: Maximal o-Polyno- r( Kom, Kon), 252 mials of Connected 3-Chromatic MacDougall, J.A.: See Daven, M., Graphs, 210 49 West, D.B.: See Jiang, T., 161 Mengersen, I.: See Lortz, R., 252 Wu, Y.: See Fiol, M.A., 171 Mohar, B.: Circular Colorings of Yoshimoto, K.: See Kaneko, A., Edge-Weighted Graphs, 107 269 Nakamoto, A.: See Kawarabaya- Zhang, C.-Q.: See Li, X., | shi, K., 26 Zhu, X.: See Pan, Z., 304 oba &e ne