Volume 287, Number 1-3, October 2004 Article
: The Möbius transform on symmetric ordered structures and its application to capacities on finite sets.
: On the 3BD-closed set B3( 4, 5 ).
: Hamiltonicity of 2-connected K1, 4, K1, 4+e-free graphs.
: Partitions modulo n and circulant matrices.
: View-obstruction: a shorter proof for 6 lonely runners.
Terry A. McKee
: Biclique comparability digraphs of bipartite graphs and minimum ranks of partial matrices.
: The statistic "number of udu's" in Dyck paths.
: The number of edge-disjoint transitive triples in a tournament.
: The Petersen graph is not 1-factorable: postscript to The Petersen graph is not 3-edge-colorable - a new proof' [Discrete Math. 268 (2003) 325-326].