default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 54
Volume 54, Number 1, March 1985
- Stefan A. Burr, Jaroslav Nesetril
, Vojtech Rödl:
On the use of senders in generalized ramsey theory for graphs. 1-13 - Marc J. Lipman:
Hamiltonian cycles and paths in vertex-transitive graphs with abelian and nilpotent groups. 15-21 - Bojan Mohar:
Akempic triangulations with 4 odd vertices. 23-29 - Péter P. Pálfy:
On the chromatic number of certain highly symmetric graphs. 31-37 - Jürgen Peemöller:
Necessary Conditions for Hamiltonian Split Graphs. 39-47 - Hans Jürgen Prömel, Bernd Voigt:
Canonizing Ramsey theorems for finite graphs and hypergraphs. 49-59 - Alain Quilliot:
A retraction problem in graph theory. 61-71 - S. B. Rao:
On regular and strongly-regular self-complementary graphs. 73-82 - Gunther Schmidt, Thomas Ströhlein:
Relation algebras: Concept of points and representability. 83-92 - R. O. Shelton, R. P. Soni:
Chains and fixing blocks in irreducible binary sequences. 93-99 - M. L. H. Willems:
Semi Minkowski i-structures. 101-106 - Feng Keqin:
A problem on algebraic graph theory. 107-109 - Bruce A. Reed:
A note on the semi-strong perfect graph conjecture. 111-112 - Richard P. Anstee, Uppaluri S. R. Murty:
Matrices with forbidden subconfigurations. 113-116 - Myriam Preissmann:
A class of strongly perfect graphs. 117-120 - Sándor Szabó:
A type of factorization of finite Abelian groups. 121-124
Volume 54, Number 2, April 1985
- Michael O. Albertson, Karen L. Collins:
Homomorphisms of 3-chromatic graphs. 127-132 - Malvina Baica:
Some new combinatorial identities derived from units in algebraic number fields. 133-141 - Ourania Chryssaphinou:
On Touchard polynomials. 143-152 - Konrad Engel, Hans-Dietrich O. F. Gronau:
An intersection-union theorem for integer sequences. 153-159 - Bruce Hedman:
The maximum number of cliques in dense graphs. 161-166 - Irwin L. Jungreis:
Infinite Hamiltonian paths in Cayley digraphs. 167-180 - John H. Reif, Paul G. Spirakis:
k-connectivity in random undirected graphs. 181-191 - Jan Reiterman, Vojtech Rödl, Edita Sinajová, Miroslav Tuma:
Threshold hypergraphs. 193-200 - Doron Zeilberger, David M. Bressoud:
A proof of Andrews' q-Dyson conjecture. 201-224 - H. J. Tiersma:
A note on Hamming spheres. 225-228 - Peter Alles:
The dimension of sums of graphs. 229-233 - Edward A. Bender, Nicholas C. Wormald:
The number of loopless planar maps. 235-237 - Geoffrey P. Whittle:
An elementary proof that every matroid is an intersection of principal transversal matroids. 239
Volume 54, Number 3, May 1985
- Albrecht Beutelspacher, Franco Eugeni:
On the type of partial t-spreads in finite projective spaces. 241-257 - Charalambos A. Charalambides, A. Kyriakoussis:
An asymptotic formula for the exponential polynomials and a central limit theorem for their coefficients. 259-270 - Meir Katchalski, Ted Lewis, Joseph Zaks:
Geometric permutations for convex sets. 271-284 - Matt Kaufmann, Saharon Shelah:
On random models of finite power and monadic logic. 285-293 - Peter Kovács:
The minimal trivalent graphs with given smallest odd cycle. 295-299 - Colin L. Mallows, Larry A. Shepp:
Enumerating pairs of permutations with the same up-down form. 301-311 - Pablo M. Salzberg:
Random number generation: A combinatorial approach. 313-320 - Douglas R. Stinson, L. Zhu:
On sets of three mols with holes. 321-328 - Walid Naji:
Reconnaissance des graphes de cordes. 329-337 - Jaroslav Nesetril, Vojtech Rödl:
Two remarks on Ramsey's theorem. 339-341 - Patricia Vanden Cruyce:
A finite graph which is locally a dodecahedron. 343-346 - G. F. Clements:
Antichains in the set of subsets of a multiset. 347
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-05 22:25 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:
