Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 64
Volume 64, Number 1, March 1987
- Paul Erdös, Nathan Linial, Shlomo Moran:
Extremal problems on permutations under cyclic equivalence. 1-11 - Alexander K. Kelmans:
A short proof and a strengthening of the Whitney 2-isomorphism theorem on graphs. 13-25 - Ivan Korec:
Improvement of Mycielski's inequality for non-natural disjoint covering system of Z. 27-38 - Frédéric Maffray, Henry Meyniel:
On a relationship between Hadwiger and stability numbers. 39-42 - Joseph J. Rotman:
Finite planes and graphs. 43-79 - Gert Sabidussi:
Color-reversal by local complementation. 81-86 - Harald Gropp:
The elementary Abelian Steiner systems S(2, 4, 49). 87-90 - Michael Stiebitz:
K5 is the only double-critical 5-chromatic graph. 91-93 - Claudio Bernardi:
On a theorem about vertex colorings of graphs. 95-96 - Christophe Champetier:
On the null-homotopy of graphs. 97-98 - P. Paulraja:
Counterexample to a conjecture on Hamilton cycles. 99 - András Sebö:
A quick proof of Seymour's theorem on t-joins. 101-103 - William T. Trotter, Douglas B. West:
Poset boxicity of graphs. 105-107
Volume 64, Numbers 2-3, April 1987
- Arkady A. Chernyak, Zhanna A. Chernyak, R. I. Tyshkevich:
On forcibly hereditary p-graphical sequences. 111-113 - Mary H. Dauenhauer, Hans Zassenhaus:
Local optimality of the critical lattice sphere-packing of regular tetrahedra. 129-146 - Anthony B. Evans:
Orthomorphisms of Zp. 147-156 - Daniel Hershkowitz:
Linear mappings which preserve acyclicity properties of graphs and digraphs and applications to matrices. 157-190 - Tayuan Huang:
An analogue of the Erdös-Ko-Rado theorem for the distance-regular graphs of bilinear forms. 191-198 - Nirmala B. Limaye, Sharad S. Sane, Mohan S. Shrikhande:
The structure of triangle-free quasi-symmetric designs. 199-207 - Fabrizio Luccio, S. Mazzone, C. K. Wong:
A note on visibility graphs. 209-219 - Melvyn B. Nathanson:
An extremal problem for least common multiples. 221-228 - Norbert Polat:
A compactness result for perfect matchings. 229-237 - Alejandro A. Schäffer:
Shortest prefix strings containing all subset permutations. 239-252 - Boris M. Schein:
Semigroups of tolerance relations. 253-262 - Jozef Sirán, Peter Horák:
A construction of thickness-minimal graphs. 263-268 - Howard Straubing:
Applications of the theory of automata in enumeration. 269-279 - Toshihiro Watanabe, S. G. Monanty:
On an inclusion-exclusion formula based on the reflection principle. 281-288 - Fuji Zhang, Xiaofeng Guo:
Hamilton cycles in directed Euler tour graphs. 289-298 - M. L. N. Downs, Gareth A. Jones:
Enumerating regular objects with a given automorphism group. 299-302 - Anthony J. W. Hilton:
Recent progress on edge-colouring graphs. 303-307 - Hiroshi Maehara:
On the number of induced subgraphs of a random graph. 309-312 - Doron Zeilberger:
Enumerating totally clean words. 313-315
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 20:21 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:
