Discrete Mathematics, Volume 287

Volume 287, Number 1-3, October 2004

• Stefka Bouyuklieva:
  Some optimal self-orthogonal and self-dual codes. 1-10
  Electronic Edition (link) BibTeX
• Zhibo Chen:
  On k-pairable graphs. 11-15
  Electronic Edition (link) BibTeX
• Michel Grabisch:
  The Möbius transform on symmetric ordered structures and its application to capacities on finite sets. 17-34
  Electronic Edition (link) BibTeX
• H. K. Hsiao, S. S. Yu, Yu-Kuang Zhao:
  Word-paired catenations of regular languages. 35-43
  Electronic Edition (link) BibTeX
• Mehri Javanian, Hosam M. Mahmoud, Mohammad Vahidi-Asl:
  Paths in m-ary interval trees. 45-53
  Electronic Edition (link) BibTeX
• L. Ji:
  On the 3BD-closed set B₃( 4, 5 ). 55-67
  Electronic Edition (link) BibTeX
• Rao Li:
  Hamiltonicity of 2-connected K_{1, 4}, K_{1, 4+e}-free graphs. 69-76
  Electronic Edition (link) BibTeX
• Gérard Maze:
  Partitions modulo n and circulant matrices. 77-84
  Electronic Edition (link) BibTeX
• John P. McSorley, Thomas Dale Porter:
  Generating sequences of clique-symmetric graphs via Eulerian digraphs. 85-91
  Electronic Edition (link) BibTeX
• Jérôme Renault:
  View-obstruction: a shorter proof for 6 lonely runners. 93-101
  Electronic Edition (link) BibTeX
• Jichang Wu, Xueliang Li, Lusheng Wang:
  Removable edges in a cycle of a 4-connected graph. 103-111
  Electronic Edition (link) BibTeX
• Ming Yao Xu, Young-Gheel Baik, Hyo-Seob Sim:
  Arc-transitive circulant digraphs of odd prime-power order. 113-119
  Electronic Edition (link) BibTeX

• Ken-ichi Kawarabayashi:
  Rooted minor problems in highly connected graphs. 121-123
  Electronic Edition (link) BibTeX
• Padmavathamma, R. Raghavendra, B. M. Chandrashekara:
  A new bijective proof of a partition theorem of K. Alladi. 125-128
  Electronic Edition (link) BibTeX
• Michael H. Albert, Robert E. L. Aldred, Mike D. Atkinson, Hans P. van Ditmarsch, Chris C. Handley, Derek A. Holton:
  Restricted permutations and queue jumping. 129-133
  Electronic Edition (link) BibTeX
• Robert E. L. Aldred, Derek A. Holton, Dingjun Lou, Ning Zhong:
  Characterizing 2k-critical graphs and n-extendable graphs. 135-139
  Electronic Edition (link) BibTeX
• Gilbert B. Cagaanan, Sergio R. Canoy Jr.:
  On the hull sets and hull number of the cartesian product of graphs. 141-144
  Electronic Edition (link) BibTeX
• Jordan Carlson, Daniel Stolarski:
  The correct solution to Berlekamp's switching game. 145-150
  Electronic Edition (link) BibTeX
• Amine El Sahili:
  Paths with two blocks in k-chromatic digraphs. 151-153
  Electronic Edition (link) BibTeX
• Dae San Kim, Dong Chan Kim:
  Character sums and MacWilliams identities. 155-160
  Electronic Edition (link) BibTeX
• Daniel Král:
  Hajós' theorem for list coloring. 161-163
  Electronic Edition (link) BibTeX
• Terry A. McKee:
  Biclique comparability digraphs of bipartite graphs and minimum ranks of partial matrices. 165-170
  Electronic Edition (link) BibTeX
• Michael D. Plummer, Xiaoya Zha:
  On the p-factor-criticality of the Klein bottle. 171-175
  Electronic Edition (link) BibTeX
• Yidong Sun:
  The statistic "number of udu's" in Dyck paths. 177-186
  Electronic Edition (link) BibTeX
• Raphael Yuster:
  The number of edge-disjoint transitive triples in a tournament. 187-191
  Electronic Edition (link) BibTeX

• Lutz Volkmann:
  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]. 193-194
  Electronic Edition (link) BibTeX