Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 160
Volume 160, Numbers 1-3, November 1996
- Frank K. Hwang, Uriel G. Rothblum, Yi-Ching Yao
:
Localizing combinatorial properties of partitions. 1-23 - Hans-Jürgen Bandelt, Victor Chepoi:
A Helly theorem in weakly modular space. 25-39 - Lowell W. Beineke, Peter Hamburger, William D. Weakley:
Random packing by rho-connected rho-regular graphs. 41-47 - Frank E. Bennett, Charles J. Colbourn, Lie Zhu:
Existence of three HMOLS of types hn and 2n31. 49-65 - Paul A. Catlin:
The reduction of graph families closed under contraction. 67-80 - Paul A. Catlin, Zheng-Yiao Han, Hong-Jian Lai:
Graphs without spanning closed trails. 81-91 - Marc Chastand, Norbert Polat:
Invariant Hamming graphs in infinite quasi-median graphs. 93-104 - Raul Cordovil, António Guedes de Oliveira, Michel Las Vergnas:
A generalized Desargues configuration and the pure braid group. 105-113 - Paul Erdös, Peter C. Fishburn:
Maximum planar sets that determine k distances. 115-125 - Peter C. Fishburn, Peter L. Hammer:
Bipartite dimensions and bipartite degrees of graphs. 127-148 - Henry H. Glover, T. Y. Yang:
A Hamilton cycle in the Cayley graph of the <2, p, 3> presentation of PSL2(p). 149-163 - Chính T. Hoàng:
Some properties of minimal imperfect graphs. 165-175 - Dean G. Hoffman, C. A. Rodger:
On the number of edge-disjoint one factors and the existence of k-factors in complete multipartite graphs. 177-187 - Eric Rémila:
Tiling a simply connected figure with bars of length 2 or 3. 189-198 - Carl G. Wagner:
Generalized Stirling and Lah numbers. 199-218 - Jiang Zeng:
Multinomial convolution polynomials. 219-228 - Yair Caro:
On the generalized Erdös-Szekeres Conjecture - a new upper bound. 229-233 - William Y. C. Chen:
The skew, relative, and classical derangements. 235-239 - Zhibo Chen:
Harary's conjectures on integral sum graphs. 241-244 - Karel Culík II:
An aperiodic set of 13 Wang tiles. 245-251 - Ira M. Gessel:
Counting acyclic digraphs by sources and sinks. 253-258 - Jarkko Kari:
A small aperiodic set of Wang tiles. 259-264 - Sandra R. Kingan, James G. Oxley:
On the matroids in which all hyperplanes are binary. 265-271 - Ilia Krasikov:
Degree conditions for vertex switching reconstruction. 273-278 - Tibor Szabó:
On nearly regular co-critical graphs. 279-281 - Hong Wang, Charles H. C. Little, Kee L. Teo:
Partition of a directed bipartite graph into two directed cycles. 283-289 - Louxin Zhang, Lian Li, Jinzhao Wu:
On the descriptive power of special Thue systems. 291-297
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-04-15 20:35 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:
