Discrete Mathematics, Volume 234

Volume 234, Number 1-3, May 2001

• Elena Barcucci, Alberto Del Lungo, Elisa Pergola, Renzo Pinzani:
  Some permutations with forbidden subsequences and their inversion number. 1-15
  Electronic Edition (link) BibTeX
• Jarmila Hedlíková:
  Relatively orthomodular lattices. 17-38
  Electronic Edition (link) BibTeX
• Pavol Hell, Alexandr V. Kostochka, André Raspaud, Eric Sopena:
  On nice graphs. 39-51
  Electronic Edition (link) BibTeX
• Refik Keskin:
  On suborbital graphs for some Hecke groups. 53-64
  Electronic Edition (link) BibTeX
• Christian Laforest, Arthur L. Liestman, Thomas C. Shermer, Dominique Sotteau:
  Edge-disjoint spanners of complete bipartite graphs. 65-76
  Electronic Edition (link) BibTeX
• Adrian Riskin:
  On the nonembeddability and crossing numbers of some toroidal graphs on the Klein bottle. 77-88
  Electronic Edition (link) BibTeX
• Hendrik Van Maldeghem:
  Sharply 2-transitive groups of projectivities in generalized polygons. 89-100
  Electronic Edition (link) BibTeX
• Zhixiong Wang, Huishan Zhou:
  On circulant chromatic number and circulant chromatic function. 101-118
  Electronic Edition (link) BibTeX
• Ron Aharoni, Eli Berger:
  The number of edges in critical strongly connected graphs. 119-123
  Electronic Edition (link) BibTeX
• Michael O. Albertson, Emily H. Moore:
  Extending graph colorings using no extra colors. 125-132
  Electronic Edition (link) BibTeX
• Lothar Dohmen, Dieter Rautenbach, Lutz Volkmann:
  i gamma(1)-perfect graphs. 133-138
  Electronic Edition (link) BibTeX
• Wayne Goddard, Michael A. Henning:
  Pancyclicity of the prism. 139-142
  Electronic Edition (link) BibTeX
• Francisco Javier González Vieli:
  A characteristic property of spheres in regular trees. 143-148
  Electronic Edition (link) BibTeX
• Toru Hasunuma:
  Completely independent spanning trees in the underlying graph of a line digraph. 149-157
  Electronic Edition (link) BibTeX
• Mirko Hornák, Stefan Pcola:
  Achromatic number of K₅?K_n for large n. 159-169
  Electronic Edition (link) BibTeX
• Robert Janczewski:
  Divisibility and T-span of graphs. 171-179
  Electronic Edition (link) BibTeX
• Romeo Rizzi:
  On 4-connected graphs without even cycle decompositions. 181-186
  Electronic Edition (link) BibTeX
• László Szegö:
  On covering intersecting set-systems by digraphs. 187-189
  Electronic Edition (link) BibTeX
• Zhi-Ping Wang, Lian-Chang Zhao:
  A necessary and sufficient condition for a graph to be edge tenacious. 191-197
  Electronic Edition (link) BibTeX