default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 66
Volume 66, Numbers 1-2, August 1987
- M. E. Adams, Hilary A. Priestley:
De Morgan algebras are universal. 1-13 - Kiyoshi Ando, Yoko Usami:
Critically (k, k)-connected graphs. 15-20 - Abdelhamid Benhocine, Jean-Luc Fouquet:
The Chvátal-Erdös condition and pancyclic line-graphs. 21-26 - Endre Boros
:
On a linear diophantine problem for geometrical type sequences. 27-33 - Richard P. Brent, Brendan D. McKay:
Determinants and ranks of random matrices over Zm. 35-49 - Yunshyong Chow:
On the number of regular configurations. 51-58 - Kevin J. Compton:
Some methods for computing component distribution probabilities in relational structures. 59-77 - William E. Fenton:
Completeness in oriented matroids. 79-89 - Ronald J. Gould, Robert Roth:
Cayley digraphs and (1, j, n)-sequencings of the alternating groups An. 91-102 - Chính T. Hoàng, Bruce A. Reed:
A note on short cycles in diagraphs. 103-107 - Frank K. Hwang, Y. H. Xu:
Double loop networks with minimum delay. 109-118 - Adam Idzik, Jan Komar, Marcin Malawski:
Edge-coloured complete graphs: Connectedness of some subgraphs. 119-125 - Bill Jackson:
Compatible Euler tours for transition systems in Eulerian graphs. 127-131 - Sandi Klavzar, Marko Petkovsek:
Intersection graphs of halflines and halfplanes. 133-137 - Inessa Levi:
Order-automorphisms of normal subsets of a power set. 139-155 - Zbigniew Lonc:
Decompositions of hypergraphs into hyperstars. 157-168 - Dragan Marusic:
Hamiltonian cycles in vertex symmetric graphs of order 2P2. 169-174 - M. L. Narayana Rao, K. Satyanarayana, G. Vithal Rao:
On a class of translation planes of square order. 175-190 - Jonathan D. H. Smith:
Minimal trees of given search number. 191-202 - André Bouchet:
Unimodularity and circle graphs. 203-208 - Douglas R. Woodall:
An impossibility theorem for electoral systems. 209-211
Volume 66, Number 3, September 1987
- Francisco Barahona, Michele Conforti:
A construction for binary matroids. 213-218 - Albrecht Beutelspacher, Klaus Metsch:
Embedding finite linear spaces in projective planes, II. 219-230 - Martin Farber, Robert E. Jamison:
On local convexity in graphs. 231-247 - Martin Farber:
Bridged graphs and geodesic convexity. 249-257 - Jeanette P. Schmidt:
Probabilistic analysis of strong hypergraph coloring algorithms and the strong chromatic number. 259-277 - Tamás Szonyi:
Note on the order of magnitude of k for complete k-arcs in PG(2, q). 279-282 - Zhe-xian Wan, Rong-hua Xiong:
Existence of self-reverse-dual m-sequences. 283-288 - Mark E. Watkins, James B. Shearer:
Counterexamples to two conjectures about distance sequences. 289-298 - Serge Lavrenchenko:
An infinite set of torus triangulations of connectivity 5 whose graphs are not uniquely embeddable in the torus. 299-301 - László Babai:
On the Nonuniform Fisher Inequality. 303-307 - András Gyárfás, Zsolt Tuza:
An upper bound on the Ramsey number of trees. 309-310 - Martin Kochol:
Construction of crossing-critical graphs. 311-313 - Ioan Tomescu:
Graphical Eulerian numbers and chromatic generating functions. 315-318 - F. Sterboul:
Letter to the editor. 319-320
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-03-10 20:51 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:
