Discrete Mathematics, Volume 177

Volume 177, Numbers 1-3, December 1997

• Michael O. Albertson, Ruth Haas:
  The edge chromatic difference sequence of a cubic graph. 1-8
  
• Andreas Brandstädt, Van Bang Le, Thomas Szymczak:
  Duchet-type theorems for powers of HHD-free graphs. 9-16
  
• Amanda G. Chetwynd, Susan J. Rhodes:
  Avoiding partial Latin squares and intricacy. 17-32
  
• Wai-Fong Chuan:
  alpha-Words and factors of characteristic sequences. 33-50
  
• T. Cole:
  Non-crossing of plane minimal spanning and minimal T1 networks. 51-65
  
• Markus Fulmek:
  Dual rook polynomials. 67-81
  
• Vassilis Giakoumakis:
  On the closure of graphs under substitution. 83-97
  
• András Gyárfás, Zoltán Király, Jenö Lehel:
  On-line 3-chromatic graphs - II critical graphs. 99-122
  
• Bill Jackson, John Sheehan:
  The structure of transform graphs. 123-144
  
• Sóstenes Lins:
  Twistors bridges among 3-manifolds. 145-165
  
• Hiren Maharaj:
  Edge frames of graphs: A graph embedding problem. 167-184
  
• Michael Plantholt, Shailesh K. Tipnis:
  The chromatic index of multigraphs of order at most 10. 185-193
  
• Victor Reiner:
  Non-crossing partitions for classical reflection groups. 195-222
  
• Zhe-xian Wan, Xinwen Wu:
  The weight hierarchies and generalized weight spectra of the projective codes from degenerate quadrics. 223-243
  
• Ping Zhang:
  The characteristic polynomials of subarrangements of Coxeter arrangements. 245-248
  
• Luigia Berardi:
  On blocking sets in a design. 249-257
  
• Connie Maude Campbell:
  On cages for girth pair (6, b). 259-266
  
• Paul Erdös, András Gyárfás, Yoshiharu Kohayakawa:
  The size of the largest bipartite subgraphs. 267-271
  
• Marcus Greferath:
  Cyclic codes over finite rings. 273-277
  
• Lenhard L. Ng:
  Hamiltonian decomposition of complete regular multipartite digraphs. 279-285
  
• Ruqun Shen, Feng Tian:
  Long dominating cycles in graphs. 287-294
  
• Stephen A. Wong:
  Extending fixed vertex-colourings to total colourings. 295-297