Discrete Mathematics 1996: Vol 161 Index

2 Pages·1996·0.39 MB·English

DISCRETE
MATHEMATICS
ELSEVIER Discrete Mathematics 161 (1996) 329-330
Author index to volume 161 (1996)
(1-3) 207-215
Amar, D., see O. Ordaz
(1-3) 285-289
Arumugam, S. and K.A. Germina, On indexable graphs (Note)
Bang-Jensen, J., G. Gutin and J. Huang, A sufficient condition for a semicomplete
ie = 2
multipartite digraph to be Hamiltonian
Bonisoli, A. and G. Korchmaros, Suzuki groups, one-factorizations and Lineburg
(1-3) 13- 24
planes
Bouchet, A. and L. Ghier, Connectivity and f-invariants of isotropic systems and
4-regular graphs (1-3) 25— 44
Boza, L., A. Dianez and A. Marquez, The center of an infinite graph (1-3) 45— 52
Buratti, M., Edge-colourings characterizing a class of Cayley graphs and a new charac-
terization of hypercubes (Note) (1-3) 291-295
Burkard, R.E., T. Dudas and T. Maier, Cut and patch Steiner trees for ladders (1-3) 53-— 61
Dianez, A., see L. Boza (1-3) 45- 52
Dillencourt, M.B. and W.D. Smith, Graph-theoretical conditions for inscribability and
Delaunay realizability (1-3) 63— 77
Dorrough, D., Convergence of sequences of iterated triangular line graphs (1-3) 79— 86
Dudas, T., see R.E. Burkard (1-3) 53-— 61
Filipoiu, A. and G. Georgescu, On values in relatively normal lattices (1-3) 87—100
Fulmek, M. and C. Krattenthaler, A bijection between Proctor’s and Sundaram’s odd
(1-3) 101-120
orthogonal tableaux
(1-3) 87-100
Georgescu, G., see A. Filipoiu
(1-3) 285-289
Germina, K.A., see S. Arumugam
(1-3) 25- 44
Ghier, L., see A. Bouchet
(1-3) 121-132
Goddard, W. and H.C. Swart, Distances between graphs under edge operations
(1-3) 133-141
Grytczuk, J., Infinite self-similar words
Ae 4-2
Gutin, G., see J. Bang-Jensen
(1-3) 143-149
Hagauer, J. and S. Klavzar, Clique-gated graphs
Hall, T.E. and M.V. Sapir, Idempotents, regular elements and sequences from finite
semigroups (1-3) 151-160
Henning, M.A., O.R. Oellermann and H.C. Swart, The diversity of domination (1-3) 161-173
Henning, M.A., O.R. Oellermann and H.C. Swart, Local edge domination critical graphs (1-3) 175-184
Huang, J., see J. Bang-Jensen (1-3) 1- 12
Klavzar, S., see J. Hagauer (1—3) 143-149
Kochol, M., A cyclically 6-edge-connected snark of order 118 (Note) (1-3) 297-300
Korchmaros, G., see A. Bonisoli (1-3) 13- 24
Krattenthaler, C., see M. Fulmek (1-3) 101-120
Kreinin, A. and A. Vainshtein, Asymptotics for Morgan numbers of fractional
orders (Note) (1—3) 301-308
Latha, L.P., see E. Sampathkumar (1-3) 235-242
Li, J. and F. Tian, A proof of a conjecture about D,-paths in graphs with large
(1-3) 185-196
neighborhood unions
(1-3) 197-205
Liu, D.D.-F., T-graphs and the channel assignment problem
(1-3) 45- 52
Marquez, A., see L. Boza
(1-3) 53- 61
Maier, T., see R.E. Burkard
(1-3) 161-173
Oellermann, O.R., see M.A. Henning
330 Author index
Oellermann, O.R., see M.A. Henning (1-3) 175-184
Ordaz, O., D. Amar and A. Raspaud, Hamiltonian properties and the bipartite indepen-
(1-3) 207-215
dence number
(1-3) 217-228
Politof, T. and A. Satyanarayana, The structure of quasi 4-connected graphs
(1-3) 309-314
Rajan, D.S. and A.M. Shende, A characterization of root lattices (Note)
(1-3) 207-215
Raspaud, A., see O. Ordaz
(1-3) 229-234
Ren, S., A sufficient condition for graphs with large neighborhood unions to be traceable
Sampathkumar, E. and L.P. Latha, Strong weak domination and domination balance in
(1-3) 235-242
a graph
Sankaranarayana, R.S. and L.K. Stewart, Recursively decomposable well-covered
graphs (1-3) 243-263
(1-3) 151-160
Sapir, M.V., see T.E. Hall
(1-3) 217-228
Satyanarayana, A., see T. Politof
(1-3) 309-314
Shende, A.M., see D.S. Rajan
(1-3) 63-77
Smith, W.D., see M.B. Dillencourt
Steffen, E., Counterexamples to a conjecture about bottlenecks in non-Tait-colourable
(1-3) 315
cubic graphs (Note)
(1-3) 243-263
Stewart, L.K., see R.S. Sankaranarayana
(1-3) 121-132
Swart, H.C., see W. Goddard
(1-3) 161-173
Swart, H.C., see M.A. Henning
(1-3) 175-184
Swart, H.C., see M.A. Henning
(1-3) 185-196
Tian, F., see J. Li
(1-3) 317-322
Toader, Gh., On Chebyshev’s inequality for sequences (Note)
(1-3) 265-283
Tyshkevich, R.I. and V.E. Zverovich, Line hypergraphs
(1-3) 301-308
Vainshtein, A., see A. Kreinin
(1-3) 323-327
Zhang, H., Characterization of self-complementary symmetric digraphs (Note)
(1-3) 265-283
Zverovich, V.E., see R.I. Tyshkevich