Discrete Mathematics, Volume 245

Volume 245, Number 1-3, February 2002

• Veerle Fack, Stijn Lievens, Joris Van der Jeugt:
  On the diameter of the rotation graph of binary coupling trees. 1-18
  Electronic Edition (link) BibTeX
• Lutz Volkmann:
  Cycles in multipartite tournaments: results and problems. 19-53
  Electronic Edition (link) BibTeX
• Méziane Aïder, Mustapha Aouchiche:
  Distance monotonicity and a new characterization of hypercubes. 55-62
  Electronic Edition (link) BibTeX
• Joel Berman, Gabriela Hauser Bordalo:
  Irreducible elements and uniquely generated algebras. 63-79
  Electronic Edition (link) BibTeX
• Jacek Blazewicz, Piotr Formanowicz, Marta Kasprzak, Daniel Kobler:
  On the recognition of de Bruijn graphs and their induced subgraphs. 81-92
  Electronic Edition (link) BibTeX
• Pierre Hansen, Brigitte Jaumard, Bruno Simeone:
  Polynomial algorithms for nested univariate clustering. 93-105
  Electronic Edition (link) BibTeX
• Clemens Heuberger:
  On hamiltonian Toeplitz graphs. 107-125
  Electronic Edition (link) BibTeX
• Yoshiyas Ishigami, Hong Wang:
  An extension of a theorem on cycles containing specified independent edges. 127-137
  Electronic Edition (link) BibTeX
• Francisco Larrión, Victor Neumann-Lara:
  On clique divergent graphs with linear growth. 139-153
  Electronic Edition (link) BibTeX
• Josef Leydold:
  The geometry of regular trees with the Faber?Krahn property. 155-172
  Electronic Edition (link) BibTeX
• Guojun Li, Chuanping Chen, Gang Yu:
  Orthogonal factorizations of graphs. 173-194
  Electronic Edition (link) BibTeX
• Rao Li, Richard H. Schelp:
  Hamiltonicity of {K_{1, 4}, K_{1, 4}+e}-free graphs. 195-202
  Electronic Edition (link) BibTeX
• Aleksander Malnic, Dragan Marusic:
  Constructing 1/2-arc-transitive graphs of valency 4 and vertex stabilizer Z₂×Z₂. 203-216
  Electronic Edition (link) BibTeX
• Sergei Ovchinnikov:
  Well-graded spaces of valued sets. 217-233
  Electronic Edition (link) BibTeX
• Zhishi Pan, Xuding Zhu:
  The circular chromatic number of series-parallel graphs of large odd girth. 235-246
  Electronic Edition (link) BibTeX
• Feng Ming Dong, Kee L. Teo, Khee Meng Koh, Michael D. Hendy:
  Non-chordal graphs having integral-root chromatic polynomials II. 247-253
  Electronic Edition (link) BibTeX
• Sheila Ferneyhough, Ruth Haas, Denis Hanson, Gary MacGillivray:
  Star forests, dominating sets and Ramsey-type problems. 255-262
  Electronic Edition (link) BibTeX
• Anka Golemac, Tanja Vucicic:
  New (100, 45, 20) symmetric designs and Bush-type Hadamard matrices of order 100. 263-272
  Electronic Edition (link) BibTeX
• Masaaki Harada:
  Self-dual Z₄-codes and Hadamard matrices. 273-278
  Electronic Edition (link) BibTeX
• Dieter Rautenbach:
  On Kelly's lemma for infinite sets of integers. 279-282
  Electronic Edition (link) BibTeX
• Matthew E. Riddle:
  The minimum forcing number for the torus and hypercube. 283-292
  Electronic Edition (link) BibTeX
• V. Yegnanarayanan:
  On a question concerning prime distance graphs. 293-298
  Electronic Edition (link) BibTeX