Discrete Mathematics & Theoretical Computer Science, Volume 7

Volume 7, Number 1, 2005

• Arthur Holshouser, Harold Reiter:
  Two Pile Move-Size Dynamic Nim. 1-10
  
• Mohamud Mohammed:
  Infinite families of accelerated series for some classical constants by the Markov-WZ Method. 11-24
  
• L. Sunil Chandran, Vadim V. Lozin, C. R. Subramanian:
  Graphs of low chordality. 25-36
  
• David R. Wood:
  Acyclic, Star and Oriented Colourings of Graph Subdivisions. 37-50
  
• Gérard Duchamp, Hatem Hadj Kacem, Éric Laugerotte:
  Algebraic elimination of epsilon-transitions. 51-70
  
• Mike D. Atkinson:
  Some equinumerous pattern-avoiding classes of permutations. 71-74
  
• Chunhui Lai:
  An extremal problem on potentially K_{p, 1, 1} -graphic sequences. 75-80
  
• Shunji Ito, Hiromi Ei:
  Tilings from some non-irreducible, Pisot substitutions. 81-122
  
• Ana M. Breda, Altino F. Santos:
  Dihedral f-tilings of the sphere by rhombi and triangles. 123-140
  
• Nesrine Abbas, Joseph C. Culberson, Lorna Stewart:
  Recognizing Maximal Unfrozen Graphs with respect to Independent Sets is CO-NP-complete. 141-154
  
• Vida Dujmovic, David R. Wood:
  Stacks, Queues and Tracks: Layouts of Graph Subdivisions. 155-202
  
• Mohammad Hosseini Dolama, Eric Sopena:
  On the maximum average degree and the incidence chromatic number of a graph. 203-216
  
• Kumar Neeraj Verma, Jean Goubault-Larrecq:
  Karp-Miller Trees for a Branching Extension of VASS. 217-230
  
• Stavros D. Nikolopoulos, Leonidas Palios:
  On the Recognition of Bipolarizable and P₄-simplicial Graphs. 231-254
  
• David R. Wood:
  Queue Layouts of Graph Products and Powers. 255-268
  
• Shigeki Akiyama, Nertila Gjini:
  Connectedness of number theoretical tilings. 269-312
  
• Charles Knessl, Wojciech Szpankowski:
  Enumeration of Binary Trees and Universal Types. 313-400