default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 94
Volume 94, Number 1, November 1991
- Mohamed M. El-Zahar, Norbert W. Sauer:
Ramsey-type properties of relational structures. 1-10 - Hong-Jian Lai:
Graph whose edges are in small cycles. 11-22 - Heinrich Niederhausen:
Initial value problems in the logarithmic algebra. 23-37 - Jozef Sirán:
Characterization of signed graphs which are cellularly embeddable in no more than one surface. 39-44 - W. C. Stephen Suen:
On the largest strong components in m-out digraphs. 45-52 - Mika Watanabe:
Arrow relations on families of finite sets. 53-64 - William Edwin Clark:
Blocking sets in finite projective spaces and uneven binary codes. 65-68 - Suk-Geun Hwang:
Doubly stochastic circulant matrices. 69-74 - Lael F. Kinch, Jenö Lehel:
The irregularity strength of tP3. 75-79
Volume 94, Number 2, November 1991
- David Hartvigsen, Russell Mardon:
Cycle bases from orderings and coverings. 81-94 - Julie Haviland:
On minimum maximal independent sets of a graph. 95-101 - Sylvia A. Hobart:
On designs related to coherent configurations of type (224). 103-127 - Y. H. Peng:
On the chromatic uniqueness of certain bipartite graphs. 129-140 - István Beck, Stein Krogdahl:
On log concave sequences. 141-145 - Andrew Granville
:
On a paper of Agur, Fraenkel and Klein. 147-151 - Shaoji Xu:
The chromatic uniqueness of complete bipartite graphs. 153-159
Volume 94, Number 3, November 1991
- Hans-Jürgen Bandelt, Henry Martyn Mulder:
Pseudo-median graphs: decomposition via amalgamation and Cartesian multiplication. 161-180 - Hortensia Galeana-Sánchez, Victor Neumann-Lara:
Extending kernel perfect digraphs to kernel perfect critical digraphs. 181-187 - Xueliang Li, Fuji Zhang:
On the numbers of spanning trees and Eulerian tours in generalized de Bruijn graphs. 189-197 - Xiaoyun Lu:
A matching game. 199-207 - Bennet Manvel, Aaron Meyerowitz, Allen J. Schwenk, K. Smith, Paul K. Stockmeyer:
Reconstruction of sequences. 209-219 - Arie Bialostocki, P. Dierker:
An isoperimetric lemma. 221-228 - Iiro S. Honkala:
All binary codes with covering radius one are subnormal. 229-232 - Jozef Sirán:
Duke's theorem does not extend to signed graph embeddings. 233-238
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 2026-08-09 23:01 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
