default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 71
Volume 71, Number 1, September 1988
- Richard A. Brualdi, Rachel Manber:
On strong digraphs with a unique minimally strong subdigraph. 1-7 - Vladimir Cepulic, Mario Essert:
Biplanes (56, 11, 2) with automorphisms of order 4 fixing some point. 9-17 - P. H. Fisher, Tim Penttila, Gordon F. Royle
:
Symmetric designs, polarities and sub-designs. 19-32 - András Gyárfás, Jenö Lehel, Zsolt Tuza:
Clumsy packing of dominoes. 33-46 - C. W. Ko, Frank Ruskey:
Solution of some multi-dimensional lattice path parity difference recurrence relations. 47-56 - Yongbing Shi:
On maximum cycle-distributed graphs. 57-71 - Carsten Thomassen:
Arc reversals in tournaments. 73-86 - Noga Alon:
Sums of subsequences modulo prime powers. 87-88 - Pierre Fraisse:
A note on distance-dominating cycles. 89-92 - Charles J. Colbourn:
Problem 94. Discret. Math. 71(1): 93 (1988)
Volume 71, Number 2, 1988
- Irith Ben-Arroyo Hartman:
Variations on the Gallai-Milgram theorem. 95-105 - E. Eliad-Badt:
Decomposition of the complete hypergraph into stars. 107-117 - Geoffrey Exoo, Donald F. Reynolds:
Ramsey numbers based on C5-decompositions. 119-127 - Graham Farr:
The subgraph homeomorphism problem for small wheels. 129-142 - Pierre Fraisse, Oscar Ordaz:
A Chvátal-Erdös condition for (t, t)-factors in digraphs using given arcs. 143-148 - Zoltán Füredi, Ivo G. Rosenberg:
Multicolored lines in a finite geometry. 149-163 - George R. T. Hendry:
Scattering number and extremal non-hamiltonian graphs. 165-175 - Yong-Chuan Chen:
A short proof of kundu's k-factor theorem. 177-179 - Reinhard Diestel:
Tree-decompositions, tree-representability and chordal graphs. 181-184
Volume 71, Number 3, 1988
- Gerhard Behrendt:
Covering posets. 189-195 - Vlad Boicescu:
Irredundant n-valued Moisil algebras. 197-204 - R. Chandrasekaran, Santosh N. Kabadi:
Pseudomatroids. 205-217 - Noboru Hamada, Michel Deza:
Characterization of {2(q+1)+2, 2;t, q}- min·hypers in PG(t, q) (t>=3, q>=5) and its applications to error-correcting codes. 219-231 - Stanislav Jendrol', Peter Mihók:
On a class of Hamiltonian polytopes. 233-241 - Rolf S. Rees:
Frames and the g(k)(v) problem. 243-256 - Saul Stahl:
A duality for permutations. 257-271 - András Gyárfás:
The irregularity strength of Km, m is 4 for odd m. 273-274
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-10-31 20:05 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:
