Discrete Mathematics, Volume 290
Volume 290, Number 1, January 2005
Frédérique Bassino, Julien Clément, Cyril Nicaud: The standard factorization of Lyndon words: an average point of view. 1-25- Robert E. Jamison, Henry Martyn Mulder: Constant tolerance intersection graphs of subtrees of a tree. 27-46
- Nándor Sieben, Elaina Deabay: Polyomino weak achievement games on 3-dimensional rectangular boards. 61-78
- Robin Chapman: A probabilistic proof of the Andrews-Gordon identities. 79-84
- Matthew Fayers: Multiple-elimination knockout tournaments with the fixed-win property. 89-97
- Jianxiang Li: A new degree condition for graphs to have [a, b]-factor. 99-103
- Dingjun Lou, Akira Saito, Lihua Teng: A note on internally disjoint alternating paths in bipartite graphs. 105-108
Volume 290, Number 2/3, February 2005
- Manoj Changat, Henry Martyn Mulder, Gerard Sierksma: Convexities related to path properties on graphs. 117-131
- David J. Grynkiewicz: On four color monochromatic sets with nondecreasing diameter. 165-171
- B. P. Tan: On the kings and kings-of-kings in semicomplete multipartite digraphs. 249-258
- Yasuo Teranishi: The number of spanning forests of a graph. 259-267
- Alexei N. Glebov, Alexandr V. Kostochka, Vladimir A. Tashkinov: Smaller planar triangle-free graphs that are not 3-list-colorable. 269-274
- H. L. Abbott, D. R. Hare: The set of values of b for which there exist block designs with b blocks. 275-282
- Yan Liu: Characterizations of maximum matching graphs of certain types. 283-289
- Lorenzo Traldi: Parallel connections and coloured Tutte polynomials. 291-299
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-19T203413 by the dblp team