Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 91
Volume 91, Number 1, August 1991
- William Y. C. Chen:
Maximum (g, f)-factors of a general graph. 1-7 - Peter Engel:
The enumeration of four-dimensional polytopes. 9-31 - Ralph J. Faudree, Ronald J. Gould, Linda M. Lesniak:
Neighborhood conditions and edge-disjoint perfect matchings. 33-43 - Ralph J. Faudree, Michael S. Jacobson, Lael F. Kinch, Jenö Lehel:
Irregularity strength of dense graphs. 45-59 - Tomasz Luczak
:
Size and connectivity of the k-core of a random graph. 61-68 - Christina M. Mynhardt:
Lower Ramsey numbers for graphs. 69-75 - James G. Oxley:
Ternary paving matroids. 77-86 - Werner Schwärzler:
Being Hamiltonian is not a Tutte invariant. 87-89 - Wayne Goddard:
Acyclic colorings of planar graphs. 91-94 - Peter Horák:
Extending partial systems of distinct representatives. 95-98 - Suk-Geun Hwang:
The monotonicity of the permanent function. 99-104 - Rahul Mukerjee, Sudhir Gupta:
Geometric construction of balanced block designs with nested rows and columns. 105-108
Volume 91, Number 2, August 1991
- H. L. Abbott, Meir Katchalski:
Further results on snakes in powers of complete graphs. 111-120 - A. Clivio:
Tilings of a torus with rectangular boxes. 121-139 - Colin Cooper:
Pancyclic Hamilton cycles in random graphs. 141-148 - Peter C. Fishburn, J. C. Lagarias, James A. Reeds, Larry A. Shepp:
Sets uniquely determined by projections on axes II Discrete case. 149-159 - Peter McMullen:
Regular polyhedra related to projective linear groups. 161-170 - Alain Quilliot:
Une condition pour qu'une famille de triangles soit orientable en un ordre cyclique. 171-182 - Christian Schindler:
Constructible hypergraphs. 183-191 - Stephen L. Snover, Charles Waiveris, John K. Williams:
Rep-tiling for triangles. 193-200 - Yeow Meng Chee:
Graphical t-designs with block sizes three and four. 201-206 - Alon Nilli:
On the second eigenvalue of a graph. 207-210 - Talmage James Reid:
A note on roundedness in 4-connected matroids. 211-214 - A. F. Sidorenko:
Triangle-free regular graphs. 215-217
Volume 91, Number 3, September 1990
- Hans-Jürgen Bandelt, Henry Martyn Mulder:
Metric characterization of parity graphs. 221-230 - Arie Bialostocki, P. Dierker, B. Voxman:
Some notes on the Erdös-Szekeres theorem. 231-238 - David Eppstein, Joan Feigenbaum, Chung-Lun Li:
Equipartitions of graphs. 239-248 - Arulappah Eswarathasan, Eugene Levine:
p-Integral harmonic sums. 249-257 - Tuvi Etzion:
Hamiltonian decomposition of K*n, patterns with distinct differences, and Tuscan squares. 259-276 - Dino J. Lorenzini:
A finite group attached to the Laplacian of a graph. 277-282 - Michelle L. Wachs:
The major index polynomial for conjugacy classes of permutations. 283-293 - Xingxing Yu:
On neighbourhood line graphs. 295-309 - Odile Favaron, Marie-Claude Heydemann, J. C. Meyer, Dominique Sotteau:
A parameter linked with G-factors and the binding number. 311-316 - K. A. Redish, W. F. Smyth:
Closed form expressions for the iterated floor function. 317-321 - Akira Saito:
One-factors and k-factors. 323-326
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-04-18 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:
