Discrete Mathematics, Volume 222

Volume 222, Number 1-3, July 2000

• Michel Bousquet, Gilbert Labelle, Pierre Leroux:
  Enumeration of planar two-face maps. 1-25
  
• Yanxun Chang, Giovanni Lo Faro:
  Existence of DBIBDs with block size not divided by four. 27-40
  
• Carmen Cortés, Atsuhiro Nakamoto:
  Diagonal flips in outer-Klein-bottle triangulations. 41-50
  
• Peter Damaschke:
  Degree-preserving spanning trees in small-degree graphs. 51-60
  
• Dominique de Werra, Alain Hertz, Daniel Kobler, Nadimpalli V. R. Mahadev:
  Feasible edge colorings of trees with cardinality constraints. 61-72
  
• Feng Ming Dong, Khee Meng Koh, Kee L. Teo, Charles H. C. Little, Michael D. Hendy:
  An attempt to classify bipartite graphs by chromatic polynomials. 73-88
  
• Hung-Lin Fu, Chin-Lin Shiue:
  The optimal pebbling number of the complete m-ary tree. 89-100
  
• Anna Galluccio, Pavol Hell, Jaroslav Nesetril:
  The complexity of H-colouring of bounded degree graphs. 101-109
  
• Weidong Gao:
  On Davenport's constant of finite abelian groups with rank three. 111-124
  
• Laurent Habsieger, Alain Plagne:
  New lower bounds for covering codes. 125-149
  
• Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Douglas F. Rall:
  Acyclic domination. 151-165
  
• Danica Jakubíková-Studenovská:
  Unoriented graphs of monounary algebras. 167-179
  
• Johan Jonasson:
  An upper bound on the cover time for powers of graphs. 181-190
  
• Liying Kang, Jinjiang Yuan:
  Bondage number of planar graphs. 191-198
  
• Vadim V. Lozin:
  Conic reduction of graphs for the stable set problem. 199-211
  
• José Plínio O. Santos, Paulo Mondek:
  A family of partitions with attached parts and 'N copies of N'. 213-222
  
• Robert Tijdeman:
  Fraenkel's conjecture for six sequences. 223-234
  
• Winston C. Yang:
  Derivatives are essentially integer partitions. 235-245
  
• Maria Axenovich:
  A generalized Ramsey problem. 247-249
  
• Roberto Cignoli, Antoni Torrens:
  Free Stone algebras. 251-257
  
• David Damanik, Douglas Zare:
  Palindrome complexity bounds for primitive substitution sequences. 259-267
  
• Gregory Gutin, Meike Tewes, Anders Yeo:
  Longest paths in strong spanning oriented subgraphs of strong semicomplete multipartite digraphs. 269-274
  
• Peter Horák, Ladislav Stacho:
  A lower bound on the number of hamiltonian cycles. 275-280
  
• Jixiang Meng, Jianzhong Wang:
  A classification of 2-arc-transitive circulant digraphs. 281-284
  
• Tsuyoshi Nishimura:
  On 1-factors and matching extension. 285-290
  
• Carl G. Wagner:
  The Carlitz lattice path polynomials. 291-298