Discrete Mathematics, Volume 184

Volume 184, Numbers 1-3, April 1998

• Ahmed Ainouche, Odile Favaron, Hao Li:
  Global insertion and hamiltonicity in DCT-graphs. 1-13
  Electronic Edition (link) BibTeX
• Richard P. Anstee, Yunsun Nam:
  More sufficient conditions for a graph to have factors. 15-24
  Electronic Edition (link) BibTeX
• Gerd Blind, Roswitha Blind:
  The almost simple cubical polytopes. 25-48
  Electronic Edition (link) BibTeX
• Bor-Liang Chen, Chun-Kan Cheng, Hung-Lin Fu, Kuo-Ching Huang:
  A study of the total chromatic number of equibipartite graphs. 49-60
  Electronic Edition (link) BibTeX
• G. F. Clements:
  Yet another generalization of the Kruskal-Katona theorem. 61-70
  Electronic Edition (link) BibTeX
• F. M. Dong, Y. P. Liu:
  All wheels with two missing consecutive spokes are chromatically unique. 71-85
  Electronic Edition (link) BibTeX
• Hortensia Galeana-Sánchez:
  Kernels in edge-colored digraphs. 87-99
  Electronic Edition (link) BibTeX
• Robert P. Gallant, Charles J. Colbourn:
  Tight 4-factor orthogonal main effect plans. 101-110
  Electronic Edition (link) BibTeX
• Petra Heijnen, Henk C. A. van Tilborg:
  Two observations concerning optimum cyclic burst-correcting codes. 111-120
  Electronic Edition (link) BibTeX
• John W. Leo:
  On coefficients of the Tutte polynomial. 121-135
  Electronic Edition (link) BibTeX
• John P. McSorley:
  Counting structures in the Möbius ladder. 137-164
  Electronic Edition (link) BibTeX
• Michal Morayne:
  Partial-order analogue of the secretary problem the binary tree case. 165-181
  Electronic Edition (link) BibTeX
• Yasuyuki Tsukui:
  Transformations of edge-coloured cubic graphs. 183-194
  Electronic Edition (link) BibTeX
• S. S. Yu:
  A characterization of local regular languages. 195-203
  Electronic Edition (link) BibTeX
• Wenan Zang:
  Coloring graphs with no odd-K₄. 205-212
  Electronic Edition (link) BibTeX
• Chuanzhong Zhu:
  Some results on intersecting families of subsets. 213-224
  Electronic Edition (link) BibTeX
• Jörg Zuther:
  Ends in digraphs. 225-244
  Electronic Edition (link) BibTeX
• Xiebin Chen:
  Some families of chromatically unique bipartite graphs. 245-252
  Electronic Edition (link) BibTeX
• Vladimir P. Korzhik:
  Nonadditivity of the 1-genus of a graph. 253-258
  Electronic Edition (link) BibTeX
• Xiaoyun Lu, Da-Wei Wang, C. K. Wong:
  On avoidable and unavoidable claws. 259-265
  Electronic Edition (link) BibTeX
• T. T. Raghunathan, M. M. Shikare, B. N. Waphare:
  Splitting in a binary matroid. 267-271
  Electronic Edition (link) BibTeX
• Jordi Recasens:
  On a geometric combinatiorial problem. 273-279
  Electronic Edition (link) BibTeX
• Carla D. Savage, Cun-Quan Zhang:
  The connectivity of acyclic orientation graphs. 281-287
  Electronic Edition (link) BibTeX
• Fuji Zhang, Guoning Lin:
  When a digraph and its line digraph are connected and cospectral. 289-295
  Electronic Edition (link) BibTeX
• Igor E. Zverovich:
  Proof of a conjecture in domination theory. 297-298
  Electronic Edition (link) BibTeX