Discrete Mathematics, Volume 304

Volume 304, Numbers 1-3, 28 November 2005

• Jean-Luc Baril, Hamamache Kheddouci, Olivier Togni:
  The irregularity strength of circulant graphs. 1-10
  
• Hossein Hajiabolhassan, Mojtaba L. Mehrabadi, Ruzbeh Tusserkani:
  Tabular graphs and chromatic sum. 11-22
  
• Pak Tung Ho:
  The crossing number of K_{4, n} on the real projective plane. 23-33
  
• K. B. Reid, E. DePalma:
  Balance in trees. 34-44
  

• Alexandr V. Kostochka, B. Y. Stodolsky:
  On domination in connected cubic graphs. 45-50
  
• Haruhide Matsuda:
  Ore-type conditions for the existence of even [2, b]-factors in graphs. 51-61
  

• Geir Dahl, Truls Flatberg:
  A remark concerning graphical sequences. 62-64
  
• Aviezri S. Fraenkel:
  Euclid and Wythoff games. 65-68
  
• Teresa W. Haynes, Michael A. Henning:
  Trees with two disjoint minimum independent dominating sets. 69-78
  
• Christophe Hohlweg:
  Minimal and maximal elements in two-sided cells of S_n and Robinson-Schensted correspondence. 79-87
  
• Dengju Ma, Han Ren, Junjie Lu:
  The crossing number of the circular graph C(2m+2, m). 88-93
  
• Miri Priesler (Moreno):
  Partitioning a graph into two pieces, each isomorphic to the other or to its complement. 94-100
  
• Dieter Rautenbach, Irene Stella:
  On the maximum number of cycles in a Hamiltonian graph. 101-107
  
• Zhengnan Shi, Wayne Goddard, Stephen T. Hedetniemi, Ken Kennedy, Renu Laskar, Alice A. McRae:
  An algorithm for partial Grundy number on trees. 108-116
  
• Sam E. Speed:
  Inequalities involving the irredundance number of a graph. 117-120
  
• Steven J. Tedford:
  A characteristic polynomial for rooted mixed graphs. 121-127
  
• Zhao Zhang, Jinjiang Yuan:
  A proof of an inequality concerning k-restricted edge connectivity. 128-134