Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 175
Volume 175, Numbers 1-3, October 1997
- J. Alpin, R. Mubarakzianow:
The bases of weighted graphs. 1-11 - Richard P. Anstee, Attila Sali:
Sperner families of bounded VC-dimension. 13-21 - Jonathan Berenbom, Joe Fendel, George T. Gilbert, Rhonda L. Hatcher:
Sliding piece puzzles with oriented tiles. 23-33 - David M. Berman, A. J. Radcliffe, Alex D. Scott, Hong Wang, Larry Wargo:
All trees contain a large induced subgraph having all degrees 1 (mod k). 35-40 - Philippe Biane:
Some properties of crossings and partitions. 41-53 - Miklós Bóna
:
Permutations avoiding certain patterns: The case of length 4 and some generalizations. 55-67 - Wende Chen, Torleiv Kløve:
Disjoint sets of distinct sum sets. 69-77 - Nam-Po Chiang, Hung-Lin Fu:
On upper bounds for the pseudo-achromatic index. 79-86 - Toshiki Endo:
The pagenumber of toroidal graphs is at most seven. 87-96 - Paul Erdös, Peter C. Fishburn:
Distinct distances in finite planar sets. 97-132 - J. Mark Ettinger:
Finitely presented partially ordered abelian groups. 133-141 - Robert Gardner, Biagio Micale, Mario Pennisi, Rebecca Zijlstra:
Cyclic and rotational hybrid triple systems. 143-161 - Maria Angela C. M. Gurgel, Yoshiko Wakabayashi:
Adjacency of vertices of the complete pre-order polytope. 163-172 - Torleiv Kløve:
On codes satisfying the double chain condition. 173-195 - Boyu Li, E. C. Milner:
The ANTI-order and the fixed point property for caccc posets. 197-209 - Alejandro Petrovich:
Equations in the theory of Q-distributive lattices. 211-219 - Jorge L. Ramírez Alfonsín:
The spread of Kn. 221-229 - Alex D. Scott:
Reconstructing sequences. 231-238 - Honghui Wan:
On nearly self-conjugate partitions of a finite set. 239-247 - Noga Alon:
Packings with large minimum kissing numbers. 249-251 - Béla Bollobás, Norbert Hegyvári, Guoping Jin:
On a problem of Erdös and Graham. 253-257 - Vladimir Cepulic:
The unique symmetric block design (61, 16, 4) admitting an automorphism of order 15 operating standardly. 259-263 - Daniel Isaksen, David Petrie Moulton:
Randomly planar graphs. 265-269 - Paul Li:
Sequencing the dihedral groups D4k. 271-276 - Xiaohui Lin, Minghua Zhu, Zhengguo Yu, Chengxue Zhang, Yuansheng Yang:
On distinct distance sets in a graph. 277-282 - P. S. Nair:
Construction of self-complementary graphs. 283-287 - Alex D. Scott:
On graph decompositions modulo k. 289-291 - Xiang-Ying Su:
Some generalizations of Menger's theorem concerning arc-connected digraphs. 293-296
a service of 
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.
last updated on 2024-06-25 21:54 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
