Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 51
Volume 51, Number 1, 1984
- M. L. Gardner:
Hypergraphs and Whitney's theorem on edge-isomorphisms of graphs. 1-9 - Charles M. Grinstead:
On circular critical graphs. 11-24 - Alon Itai, Avram Zehavi:
Bounds on path connectivity. 25-34 - Robert E. Jamison, Richard J. Nowakowski
:
A Helly theorem for convexity in graphs. 35-39 - A. Kyriakoussis:
A central limit theorem for numbers satisfying a class of triangular arrays. 41-46 - P. Marchioro, Aurora Morgana, Rossella Petreschi, Bruno Simeone:
Degree sequences of matrogenic graphs. 47-61 - James G. Oxley:
On minor-minimally-connected matroids. 63-72 - C. A. Rodger:
Embedding an incomplete latin square in a latin square with a prescribed diagonal. 73-89 - Regina Tyshkevich:
Once more on matrogenic graphs. 91-100 - Doron Zeilberger:
A short hook-lengths bijection inspired by the Greene-Nijenhuis-Wilf proof. 101-108 - Doron Zeilberger:
Garsia and Milne's bijective proof of the inclusion-exclusion principle. 109-110
Volume 51, Number 2, 1984
- André Bonnin, Jean Marcel Pallo:
Sur la generation des arbres binaires par les B-suites. 111-117 - Tom C. Brown:
Common transversals for partitions of a finite set. 119-124 - A. Robert Calderbank, David B. Wales:
The Haemers partial geometry and the Steiner system S(5, 8, 24). 125-136 - R. Chandrasekaran, S. Shirali:
Total weak unimodularity: testing and applications. 137-145 - János Körner, Victor K. Wei:
Odd and even hamming spheres also have minimum boundary. 147-165 - Natwar N. Roghelia, Sharad S. Sane:
Classification of (16, 6, 2)-designs by ovals. 167-177 - Cees Roos, A. J. van Zanten:
On the existence of certain generalized Moore geometries, part I. 179-190 - Najiba Sbihi, J. P. Uhry:
A class of h-perfect graphs. 191-205 - Shaoji Xu, Nianzu Li:
The chromaticity of wheels. 207-212 - Malaz Maamoun, Henry Meyniel:
On a problem of G. Hahn about coloured hamiltonian paths in K2t. 213-214
Volume 51, Number 3, 1984
- Alexander K. Kelmans:
A strengthening of the Kuratowski planarity criterion for 3-connected graphs. 215-220 - C. J. Liu:
The generating function of Whitworth runs. 221-228 - Guglielmo Lunardon:
On regular parallelisms in PG(3, q). 229-235 - Terry A. McKee:
Recharacterizing Eulerian: Intimations of new duality. 237-242 - Lía Oubiña, R. Zucchello:
A generalization of outerplanar graphs. 243-249 - Alain Quilliot:
Circular representation problem on hypergraphs. 251-264 - Richard D. Ringeisen:
On cycle permutation graphs. 265-275 - Cees Roos, A. J. van Zanten:
On the existence of certain generalized Moore geometries, part II. 277-282 - Joseph A. Thas, I. Debroey, Frank De Clerck:
The embedding of (0, alpha)-geometries in PG(n, q): part II. 283-292 - David Witte, Joseph A. Gallian:
A survey: Hamiltonian cycles in Cayley graphs. 293-304 - P. S. Gill:
A note on construction of symmetrical PBIB designs. 305-307 - Haim Hanani:
On the original Steiner Systems. 309-310 - A. Mukhopadhyay:
On the probability that the determinant of an n x n matrix over a finite field vanishes. 311-315 - Dale Skrien:
Interval line graphs. 317-318 - Dominique de Werra:
Variation on a theorem of König. 319-321
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-07-08 21:18 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:
