Discrete Mathematics, Volume 242

Volume 242, Number 1-3, January 2002

• Méziane Aïder:
  Almost distance-hereditary graphs. 1-16
  Electronic Edition (link) BibTeX
• Jason I. Brown, Carl A. Hickman:
  On chromatic roots of large subdivisions of graphs. 17-30
  Electronic Edition (link) BibTeX
• Márcia R. Cerioli, Jayme Luiz Szwarcfiter:
  Edge clique graphs and some classes of chordal graphs. 31-39
  Electronic Edition (link) BibTeX
• Gary Chartrand, Ping Zhang:
  The Steiner number of a graph. 41-54
  Electronic Edition (link) BibTeX
• Bo Cheng, Gary L. Mullen:
  Constructions for mutually orthogonal frequency hyperrectangles with a prescribed type. 55-64
  Electronic Edition (link) BibTeX
• Sunil Chopra, Chih-Yang Tsai:
  A branch-and-cut approach for minimum cost multi-level network design. 65-92
  Electronic Edition (link) BibTeX
• Teresa W. Haynes, Michael A. Henning:
  Trees with equal domination and tree-free domination numbers. 93-102
  Electronic Edition (link) BibTeX
• Michael A. Henning, Ortrud Oellermann:
  The upper domination Ramsey number u(3, 3, 3). 103-113
  Electronic Edition (link) BibTeX
• Neil Hindman, Imre Leader, Dona Strauss:
  Image partition regular matrices--bounded solutions and preservation of largeness. 115-144
  Electronic Edition (link) BibTeX
• Chính T. Hoàng, Colin J. H. McDiarmid:
  On the divisibility of graphs. 145-156
  Electronic Edition (link) BibTeX
• Václav Koubek, Jirí Sichler:
  Endomorphism monoids of chained graphs. 157-174
  Electronic Edition (link) BibTeX
• James G. Oxley, Charles Semple, Dirk L. Vertigan, Geoffrey P. Whittle:
  Infinite antichains of matroids with characteristic set {p}. 175-185
  Electronic Edition (link) BibTeX
• Han Ren, Yanpei Liu:
  Enumeration of simple bipartite maps on the sphere and the projective plane. 187-200
  Electronic Edition (link) BibTeX
• Meike Tewes, Lutz Volkmann, Anders Yeo:
  Almost all almost regular c-partite tournaments with cgeq5 are vertex pancyclic. 201-228
  Electronic Edition (link) BibTeX
• William D. Weakley:
  Upper bounds for domination numbers of the queen's graph. 229-243
  Electronic Edition (link) BibTeX
• Zhengsheng Wu, Xuerong Zhang, Xinghe Zhou:
  Hamiltonicity, neighborhood intersections and the partially square graphs. 245-254
  Electronic Edition (link) BibTeX
• Liming Xiong, Hajo Broersma, Cornelis Hoede, Xueliang Li:
  Degree sums and subpancyclicity in line graphs. 255-267
  Electronic Edition (link) BibTeX
• Roberto Canogar:
  An example related to the best code of reconstructing the cells of a partition design from its adjacency matrix. 269-276
  Electronic Edition (link) BibTeX
• Satoru Iwata:
  On matroid intersection adjacency. 277-281
  Electronic Edition (link) BibTeX
• Peter Che Bor Lam, Wai Chee Shiu, Wai Hong Chan:
  Characterization of graphs with equal bandwidth and cyclic bandwidth. 283-289
  Electronic Edition (link) BibTeX
• Mirko Lepovic, Ivan Gutman:
  No starlike trees are cospectral. 291-295
  Electronic Edition (link) BibTeX
• Mark Ramras:
  A set intersection theorem and an application to a bipartite Ramsey theorem. 297-298
  Electronic Edition (link) BibTeX