Table Of Content

Discrete Mathematics Volume 184, Numbers 1-3, 6 April 1998 Contents Contributions A. Ainouche, O. Favaron and H. Li Global insertion and hamiltonicity in DCT-graphs R.P. Anstee and Y. Nam More sufficient conditions for a graph to have factors G. Blind and R. Blind The almost simple cubical polytopes B.-L. Chen, C.-K. Cheng, H.-L. Fu and K.-C. Huang A study of the total chromatic number of equibipartite graphs G.F. Clements Yet another generalization of the Kruskal-—Katona theorem F.M. Dong and Y.P. Liu All wheels with two missing consecutive spokes are chromatically unique H. Galeana-Sanchez Kernels in edge-colored digraphs R. Gallant and C.J. Colbourn Tight 4-factor orthogonal main effect plans P. Heijnen and H. van Tilborg Two observations concerning optimum cyclic burst-correcting codes J.W. Leo On coefficients of the Tutte polynomial J.P. McSorley Counting structures in the Mdébius ladder M. Morayne Partial-order analogue of the secretary problem: The binary tree case Y. Tsukui Transformations of edge-coloured cubic graphs $.S. Yu A characterization of local regular languages W. Zang Coloring graphs with no odd-K, C. Zhu Some results on intersecting families of subsets J. Zuther Ends in digraphs Discrete Mathematics Volume 184, Numbers 1-3, 6 April 1998 Contents Contributions A. Ainouche, O. Favaron and H. Li Global insertion and hamiltonicity in DCT-graphs R.P. Anstee and Y. Nam More sufficient conditions for a graph to have factors G. Blind and R. Blind The almost simple cubical polytopes B.-L. Chen, C.-K. Cheng, H.-L. Fu and K.-C. Huang A study of the total chromatic number of equibipartite graphs G.F. Clements Yet another generalization of the Kruskal-—Katona theorem F.M. Dong and Y.P. Liu All wheels with two missing consecutive spokes are chromatically unique H. Galeana-Sanchez Kernels in edge-colored digraphs R. Gallant and C.J. Colbourn Tight 4-factor orthogonal main effect plans P. Heijnen and H. van Tilborg Two observations concerning optimum cyclic burst-correcting codes J.W. Leo On coefficients of the Tutte polynomial J.P. McSorley Counting structures in the Mdébius ladder M. Morayne Partial-order analogue of the secretary problem: The binary tree case Y. Tsukui Transformations of edge-coloured cubic graphs $.S. Yu A characterization of local regular languages W. Zang Coloring graphs with no odd-K, C. Zhu Some results on intersecting families of subsets J. Zuther Ends in digraphs Notes X. Chen Some families of chromatically unique bipartite graphs V.P. Korzhik Nonadditivity of the 1-genus of a graph X. Lu, D.-W. Wang and C.K. Wong On avoidable and unavoidable claws T.T. Raghunathan, M.M. Shikare and B.N. Waphare Splitting in a binary matroid J. Recasens On a geometric combinatorial problem C.D. Savage and C.-Q. Zhang The connectivity of acyclic orientation graphs F. Zhang and G. Lin When a digraph and its line digraph are connected and cospectral I.E. Zverovich Proof of a conjecture in domination theory Author index to volume 184 Hee Ss one ee4 e:u e, SSga rat ea : baron!