default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 102
Volume 102, Number 1, May 1992
- Lothar Collatz:
The 93 classes of equatilings of the plane with characteristics >=3. 1-11 - Stephan Foldes
, Ivan Rival, Jorge Urrutia:
Light sources, obstructions and spherical orders. 13-23 - G. M. Hamilton, Douglas G. Rogers:
Further results on irregular, critical perfect systems of difference sets I: split systems. 25-45 - George R. T. Hendry:
An Ore-type sufficient condition for a bipancyclic ordering. 47-49 - Xingxing Yu:
On several symmetry conditions for graphs. 51-59 - J. H. E. Cohn:
A D-optimal design of order 102. 61-65 - Chính T. Hoàng, Frédéric Maffray, Stephan Olariu, Myriam Preissmann:
A charming class of perfectly orderable graphs. 67-74 - Peter Kleinschmidt, Shmuel Onn:
On the diameter of convex polytopes. 75-77 - Shixin Sun, Charles Payan:
Sur l'immersion gracieuse de KN dans Qn. 79-83 - Doron Zeilberger:
A proof of Julian West's conjecture that the number of two-stacksortable permutations of length n is 2(3n)!/((n + 1)!(2n + 1)!). 85-93 - Oleg V. Borodin:
Diagonal coloring of the vertices of triangulations. 95-96 - Oleg V. Borodin, Jean Mayer:
Decomposition of K13 into a torus graph and a graph imbedded in the Klein bottle. 97-98 - Jason I. Brown:
A vertex critical graph without critical edges. 99-101 - Leizhen Cai, Derek G. Corneil:
On cycle double covers of line graphs. 103-106 - M. R. Hart, Xingxing Yu:
On a problem of Hendry. 107-108 - Daniel Bienstock:
Corrigendum to: D. Bienstock, "On the complexity of testing for odd holes and induced odd paths" Discrete Mathematics 90 (1991) 85-92. 109
Volume 102, Number 2, May 1992
- Annie Astié-Vidal, Vincent Dugat:
Near-homogeneous tournaments and permutation groups. 111-120 - Lou Caccetta, W. F. Smyth:
Graphs of maximum diameter. 121-141 - Yves Crama, Martin Loebl, Svatopluk Poljak:
A decomposition of strongly unimodular matrices into incidence matrices of diagraphs. 143-147 - Joseph Hammer, Dinesh G. Sarvate:
Generalizations of results of Stanton on BIBDs. 149-154 - Olof Heden:
On the modular n-queen problem. 155-161 - Bill Jackson, Hao Li, Yongjin Zhu:
Dominating cycles in regular 3-connected graphs. 163-176 - Alphonse Baartmans, Walter D. Wallis, Joseph L. Yucas:
A geometric construction of the Steiner system S(4, 7, 23). 177-186 - Wendy J. Myrvold:
The degree sequence is reconstructible from n-1 cards. 187-196 - Elke Wilkeit:
The retracts of Hamming graphs. 197-218
Volume 102, Number 3, May 1992
- Denise Amar:
A condition for a hamiltonian bipartite graph to be bipancyclic. 221-227 - Elena Barcucci, M. Cecilia Verri:
Some more properties of Catalan numbers. 229-237 - Richard A. Brualdi, Ning Cai, Vera Pless:
Orphan structure of the first-order Reed-Muller codes. 239-247 - Paul Erdös, András Sárközy:
Arithmetic progressions in subset sums. 249-264 - Bruce M. Landman:
Ramsey functions related to the van der waerden numbers. 265-278 - Dragan Marusic, Raffaele Scapellato, Norma Zagaglia Salvi:
Generalized Cayley graphs. 279-285 - Lawrence S. Moss:
Distanced graphs. 287-305 - John Sheehan:
Balanced graphs with minimum degree constraints. 307-314 - Douglas R. Woodall:
Local and global proportionality. 315-328
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-04 22:09 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:
