Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 88
Volume 88, Number 1, March 1991
- Robert E. L. Aldred, Bill Jackson, Dingjun Lou, Akira Saito:
Partitioning regular graphs into equicardinal linear forests. 1-9 - Thomas Andreae, Martin Schughart, Zsolt Tuza:
Clique-transversal sets of line graphs and complements of line graphs. 11-20 - Konrad J. Heuvers, Daniel S. Moak:
The solution of the Binet-Cauchy functional equation for square matrices. 21-32 - C. J. Knickerbocker, Patti Frazer Lock, Michael Sheard:
On the structure of graphs uniquely hamiltonian-connected from a vertex. 33-48 - Christos Koukouvinos, Stratis Kounias, Jennifer Seberry:
Supplementary difference sets and optimal designs. 49-58 - Esther R. Lamken:
3-complementary frames and doubly near resolvable (v, 3, 2)- BIBDs. 59-78 - Chiang Lin:
The dimension of the cartesian product of posets. 79-92 - Rodica Simion:
Trees with 1-factors and oriented trees. 93-104
Volume 88, Numbers 2-3, April 1991
- Martin Aigner, Rudolf Wille:
Preface. 111 - Martin Aigner, Dwight Duffus, Daniel J. Kleitman:
Partitioning a power set into union-free classes. 113-119 - Thomas Andreae:
A search problem on graphs which generalizes some group testing problems with two defectives. 121-127 - Graham R. Brightwell, Jaroslav Nesetril
:
Reorientations of covering graphs. 129-132 - Vincent Duquenne:
The core of finite lattices. 133-147 - Bernhard Ganter, Hans-Dietrich O. F. Gronau:
Two conjectures of Demetrovics, Füredi, and Katona, concerning partitions. 149-155 - Gerhard Gierz, Ferdinand Hergert:
The bandwidth problem for distributive lattices of breadth 3. 157-177 - Daniel Grieser:
Some results on the complexity of families of sets. 179-192 - Jerrold R. Griggs:
Iterated exponentials of two numbers. 193-209 - Michel Habib, David Kelly, Rolf H. Möhring:
Interval dimension is a comparability invariant. 211-229 - Hal A. Kierstead:
A polynomial time approximation algorithm for dynamic storage allocation. 231-237 - Wei-Ping Liu, Ivan Rival:
Enumerating orientations of ordered sets. 239-247 - Peter Luksch:
Distributive lattices freely generated by an ordered set of width two. 249-258 - Tom Madej, Douglas B. West:
The interval inclusion number of a partially ordered set. 259-277 - Oliver Pretzel, Dale Youngs:
Balanced graphs and noncovering graphs. 279-287 - Klaus Reuter:
The jump number and the lattice of maximal antichains. 289-307 - Rudolf Wille:
The skeletons of free distributive lattices. 309-320
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-25 05:29 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:
