- Email: [email protected]
Author index to volume 184 (1998)
DISCRETE MATHEMATICS ELSEVIER
Discrete Mathematics 184 (1998) 299-300
Author index to volume 184 (1998)
Ainouche, A., O. Favaron and H. Li, Global insertion and hamiltonicity in DCTgraphs Anstee, R.P. and Y. Nam, More sufficient conditions for a graph to have factors Blind, G. and R. Blind, The almost simple cubical polytopes Blind, R., see G. Blind Chen, B.-L., C.-K. Cheng, H.-L. Fu and K.-C. Huang, A study of the total chromatic number of equibipartite graphs Chen, X., Some families of chromatically unique bipartite graphs (Note) Cheng, C.-K., see B.-L. Chen Clements, G.F., Yet another generalization of the Kruskal-Katona theorem Colbourn, C.J., see R. Gallant Dong, F.M. and Y.P. Liu, All wheels with two missing consecutive spokes are chromatically unique Favaron, O., see A. Ainouche Fu, H.-L., see B.-L. Chen Galeana-Shnchez, H., Kernels in edge-colored digraphs Gallant, R. and C.J. Colbourn, Tight 4-factor orthogonal main effect plans Heijnen, P. and H. van Tilborg, Two observations concerning optimum cyclic burstcorrecting codes Huang, K.-C., see B.-L. Chen Korzhik, V.P., Nonadditivity of the 1-genus of a graph (Note) Leo, J.W., On coefficients of the Tutte polynomial Li, H., see A. Ainouche Lin, G., see F. Zhang Liu, Y.P., see F.M. Dong Lu, X., D.-W. Wang and C.K. Wong, On avoidable and unavoidable claws (Note) McSorley, J.P., Counting structures in the Mrbius ladder Morayne, M., Partial-order analogue of the secretary problem: The binary tree case Nam, Y., see R.P. Anstee Raghunathan, T.T., M.M. Shikare and B.N. Waphare, Splitting in a binary matroid
(Note) Recasens, J., On a geometric combinatorial problem (Note) Savage, C.D. and C.-Q. Zhang, The connectivity of acyclic orientation graphs
(Note) Shikare, M.M., see T.T. Raghunathan Tsukui, Y., Transformations of edge-coloured cubic graphs van Tilborg, H., see P. Heijnen Wang, D.-W., see X. Lu Waphare, B.N., see T.T. Raghunathan Wong, C.K., see X. Lu Yu, S.S., A characterization of local regular languages Zang, W., Coloring graphs with no odd-K4 Zhang, C.-Q, see C.D. Savage
(1-3) (1-3) (1-3) (1-3)
1152525-
13 24 48 48
(1-3) 49- 60 (1-3) 245-252 (1-3) 49- 60 (l-3) 61 70 (1-3) 101-110 (1-3) 71- 85 (1-3) 1- 13 (1-3) 49- 60 (1-3) 87- 99 (1-3) 101-110 (1-3) (1-3) (1-3) (1-3) (1-3) (1-3) (1-3) (1-3) (1-3) (1-3) (1-3)
111-120 49- 60 253 258 121-135 1- 13 289-295 71- 85 259-265 137-164 165-181 15 24
(1-3) 267-271 (1-3) 273-279 (1-3) (1-3) (1-3) (1-3) (1-3) (1-3) (1-3) (1-3) (1-3) (1-3)
281-287 267-271 183-194 111-120 259-265 267-271 259-265 195-203 205-212 281-287
300
Author index
Zhang, F. and G. Lin, When a digraph and its line digraph are connected and cospectral (Note) Zhu, C., Some results on intersecting families of subsets Zuther, J., Ends in digraphs Zverovich, I.E., Proof of a conjecture in domination theory (Note)
(1-3) (1-3) (1-3) (1-3)
289-295 213-224 225-244 297-298
Discrete Mathematics 184 (1998) 299-300
Author index to volume 184 (1998)
Ainouche, A., O. Favaron and H. Li, Global insertion and hamiltonicity in DCTgraphs Anstee, R.P. and Y. Nam, More sufficient conditions for a graph to have factors Blind, G. and R. Blind, The almost simple cubical polytopes Blind, R., see G. Blind Chen, B.-L., C.-K. Cheng, H.-L. Fu and K.-C. Huang, A study of the total chromatic number of equibipartite graphs Chen, X., Some families of chromatically unique bipartite graphs (Note) Cheng, C.-K., see B.-L. Chen Clements, G.F., Yet another generalization of the Kruskal-Katona theorem Colbourn, C.J., see R. Gallant Dong, F.M. and Y.P. Liu, All wheels with two missing consecutive spokes are chromatically unique Favaron, O., see A. Ainouche Fu, H.-L., see B.-L. Chen Galeana-Shnchez, H., Kernels in edge-colored digraphs Gallant, R. and C.J. Colbourn, Tight 4-factor orthogonal main effect plans Heijnen, P. and H. van Tilborg, Two observations concerning optimum cyclic burstcorrecting codes Huang, K.-C., see B.-L. Chen Korzhik, V.P., Nonadditivity of the 1-genus of a graph (Note) Leo, J.W., On coefficients of the Tutte polynomial Li, H., see A. Ainouche Lin, G., see F. Zhang Liu, Y.P., see F.M. Dong Lu, X., D.-W. Wang and C.K. Wong, On avoidable and unavoidable claws (Note) McSorley, J.P., Counting structures in the Mrbius ladder Morayne, M., Partial-order analogue of the secretary problem: The binary tree case Nam, Y., see R.P. Anstee Raghunathan, T.T., M.M. Shikare and B.N. Waphare, Splitting in a binary matroid
(Note) Recasens, J., On a geometric combinatorial problem (Note) Savage, C.D. and C.-Q. Zhang, The connectivity of acyclic orientation graphs
(Note) Shikare, M.M., see T.T. Raghunathan Tsukui, Y., Transformations of edge-coloured cubic graphs van Tilborg, H., see P. Heijnen Wang, D.-W., see X. Lu Waphare, B.N., see T.T. Raghunathan Wong, C.K., see X. Lu Yu, S.S., A characterization of local regular languages Zang, W., Coloring graphs with no odd-K4 Zhang, C.-Q, see C.D. Savage
(1-3) (1-3) (1-3) (1-3)
1152525-
13 24 48 48
(1-3) 49- 60 (1-3) 245-252 (1-3) 49- 60 (l-3) 61 70 (1-3) 101-110 (1-3) 71- 85 (1-3) 1- 13 (1-3) 49- 60 (1-3) 87- 99 (1-3) 101-110 (1-3) (1-3) (1-3) (1-3) (1-3) (1-3) (1-3) (1-3) (1-3) (1-3) (1-3)
111-120 49- 60 253 258 121-135 1- 13 289-295 71- 85 259-265 137-164 165-181 15 24
(1-3) 267-271 (1-3) 273-279 (1-3) (1-3) (1-3) (1-3) (1-3) (1-3) (1-3) (1-3) (1-3) (1-3)
281-287 267-271 183-194 111-120 259-265 267-271 259-265 195-203 205-212 281-287
300
Author index
Zhang, F. and G. Lin, When a digraph and its line digraph are connected and cospectral (Note) Zhu, C., Some results on intersecting families of subsets Zuther, J., Ends in digraphs Zverovich, I.E., Proof of a conjecture in domination theory (Note)
(1-3) (1-3) (1-3) (1-3)
289-295 213-224 225-244 297-298