default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 87
Volume 87, Number 1, January 1991
- Michael H. Albert, Alan M. Frieze
:
Occupancy problems and random algebras. 1-8 - Maria Rita Casali, Luigi Grasselli:
2-Symmetric crystallizations and 2-fold branched coverings of S3. 9-22 - Ding-Zhu Du, D. Frank Hsu:
Partitionable starters for twin prime power type. 23-28 - F. Göbel, J. Orestes Cerdeira, Henk Jan Veldman:
Label-connected graphs and the gossip problem. 29-40 - Irith Ben-Arroyo Hartman, Ilan Newman, Ran Ziv:
On grid intersection graphs. 41-52 - Felix Lazebnik:
Some corollaries of a theorem of Whitney on the chromatic polynomial. 53-64 - Laura A. Sanchis:
Maximum number of edges in connected graphs with a given domination number. 65-72 - Sze-Chin Shee:
Some results on lambda-valuation of graphs involving complete bipartite graphs. 73-80 - Endre Boros:
On shift stable hypergraphs. 81-84 - Gustav Burosch, Jean-Marie Laborde:
Characterization of grid graphs. 85-88 - Peter J. Cameron:
Several 2-(46, 6, 3) designs. 89-90 - Sheshayya A. Choudum:
On graphic and 3-hypergraphic sequences. 91-95 - Hiroshi Maehara:
The intersection graph of random sets. 97-104 - Balázs Montágh:
A simple proof and a generalization of an old result of Chung and Feller. 105-108
Volume 87, Number 2, January 1991
- Denise Amar, André Raspaud:
Covering the vertices of a digraph by cycles of prescribed length. 111-118 - Béla Bollobás, H. R. Hind:
Graphs without large triangle free subgraphs. 119-131 - Jacques Désarménien, Dominique Foata:
Statistiques d'ordre sur les permutations colorées. 133-148 - Tom Greene:
Descriptively sufficient subcollections of flats in matroids. 149-161 - Wei-Ping Liu, Ivan Rival:
Inversions, cuts, and orientations. 163-174 - Martin Skoviera:
The maximum genus of graphs of diameter two. 175-180 - Guo-Zhen Xiao, Ba-Zhong Shen, Chuan-Kun Wu, Chi Song Wong:
Some spectral techniques in coding theory. 181-186 - Mieko Yamada:
Hadamard matrices of generalized quaternion type. 187-196 - Yongjin Zhu, Feng Tian, Xiaotie Deng:
More powerful closure operations on graphs. 197-214 - Olof Heden:
No partial 1-spread of class [0, >=2]d in PG(2d-1, q) exists. 215-216 - Liang Sun:
On a problem of J. Csima. 217-218
Volume 87, Number 3, February 1991
- B. A. Anderson:
A product theorem for 2-sequencings. 221-236 - Phyllis Z. Chinn, R. Bruce Richter, Miroslaw Truszczynski:
Primal graphs with small degrees. 237-248 - James D. Currie:
Which graphs allow infinite nonrepetitive walks? 249-260 - Paul Erdös, Fred Galvin:
Some Ramsey-type theorems. 261-269 - Hortensia Galeana-Sánchez, Victor Neumann-Lara:
Orientations of graphs in kernel theory. 271-280 - Katherine Heinrich, Lisheng Wu, Lie Zhu:
Incomplete self-orthogonal latin squares ISOLS(6m + 6, 2m) exist for all m. 281-290 - Germain Kreweras, Paul Moszkowski:
Tree codes that preserve increases and degree sequences. 291-296 - J. C. Parnami:
The iteration of a bijective transformation of integer k-tuples mod m. 297-307 - Miroslaw Truszczynski, Zsolt Tuza:
Asymptotic results on saturated graphs. 309-314 - Melvin F. Janowitz:
A converse to the Sholander embedding. 315-318 - Louis W. Shapiro:
Voting blocks, reluctant functions, and a formula of Hurwitz. 318-322 - Gerhard J. M. van Wee:
On the non-existence of certain perfect mixed codes. 323-326
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 2025-12-02 23:31 CET 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:
