Discrete Mathematics, Volume 239
Volume 239, Number 1-3, August 2001
Tara S. Holm: On majority domination in graphs. 1-12- Erich Neuwirth: Recursively defined combinatorial functions: extending Galton's board. 33-51
- Rudolf Winkel: A combinatorial derivation of the Poincare' polynomials of the finite irreducible Coxeter groups. 83-99
- Arie Bialostocki, William Voxman: Generalizations of some Ramsey-type theorems for matchings. 101-107
- Ezra Brown, Theresa P. Vaughan: Cycles of directed graphs defined by matrix multiplication (mod n). 109-120
- Masaaki Harada: An extremal ternary self-dual [28, 14, 9] code with a trivial automorphism group. 121-125
- Wenjie He, Yufa Shen, Lixin Wang, Yanxun Chang, Qingde Kang, Xinkai Yu: The integral sum number of complete bipartite graphs Kr, s. 137-146
- Dhruv Mubayi, Todd G. Will, Douglas B. West: Realizing degree imbalances in directed graphs. 147-153
- Artem V. Pyatkin: New formula for the sum number for the complete bipartite graphs. 155-160
- Romeo Rizzi: On the recognition of P4-indifferent graphs. 161-169
- Sara Nadiv Soffer: Graphs with many large degrees. 171-177
- Baogen Xu: On signed edge domination numbers of graphs. 179-189
- Jian-Zhou Zhang, Zhi-Sheng You, Zheng-Liang Li: Enumeration of binary orthogonal arrays of strength 1. 191-198
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-18T211851 by the dblp team