default search action
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 - Jarmila Hedlíková:
Relatively orthomodular lattices. 17-38 - Pavol Hell, Alexandr V. Kostochka, André Raspaud, Éric Sopena:
On nice graphs. 39-51 - Refik Keskin:
On suborbital graphs for some Hecke groups. 53-64 - Christian Laforest, Arthur L. Liestman, Thomas C. Shermer, Dominique Sotteau:
Edge-disjoint spanners of complete bipartite graphs. 65-76 - Adrian Riskin:
On the nonembeddability and crossing numbers of some toroidal graphs on the Klein bottle. 77-88 - Hendrik Van Maldeghem:
Sharply 2-transitive groups of projectivities in generalized polygons. 89-100 - Zhixiong Wang, Huishan Zhou:
On circulant chromatic number and circulant chromatic function. 101-118 - Ron Aharoni, Eli Berger:
The number of edges in critical strongly connected graphs. 119-123 - Michael O. Albertson, Emily H. Moore:
Extending graph colorings using no extra colors. 125-132 - Lothar Dohmen, Dieter Rautenbach, Lutz Volkmann:
i gamma(1)-perfect graphs. 133-138 - Wayne Goddard, Michael A. Henning:
Pancyclicity of the prism. 139-142 - Francisco Javier González Vieli:
A characteristic property of spheres in regular trees. 143-148 - Toru Hasunuma:
Completely independent spanning trees in the underlying graph of a line digraph. 149-157 - Mirko Hornák, Stefan Pcola:
Achromatic number of K5?Kn for large n. 159-169 - Robert Janczewski:
Divisibility and T-span of graphs. 171-179 - Romeo Rizzi:
On 4-connected graphs without even cycle decompositions. 181-186 - László Szegö:
On covering intersecting set-systems by digraphs. 187-189 - Zhi-Ping Wang, Lian-Chang Zhao:
A necessary and sufficient condition for a graph to be edge tenacious. 191-197
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.