default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 62
Volume 62, Number 1, October 1986
- David W. Barnette:
Every simple 3-polytype with 34 vertices is Hamiltonian. 1-20 - Anna Donati:
Lins-Mandel manifolds as branched coverings of S3. 21-27 - Gena Hahn, Carsten Thomassen:
Path and cycle sub-ramsey numbers and an edge-colouring conjecture. 29-33 - Nora Hartsfield:
The toroidal splitting number of the complete graph Kn. 35-47 - Frank K. Hwang, J. F. Weng:
Hexagonal coordinate systems and steiner minimal trees. 49-57 - B. L. Misra:
On construction of partially balanced n-ary designs. 59-64 - Victor Neumann-Lara, Nicola Santoro
, Jorge Urrutia:
Uniquely colourable m-dichromatic oriented graphs. 65-70 - James G. Oxley:
On ternary transversal matroids. 71-83 - Zhe-xian Wan, Rong-hua Xiong, Min-an Yu:
On the number of cycles of short length in the DE Bruijn-good graph Gn. 85-98 - Richard A. Brualdi, J. Csima:
Extending subpermutation matrices in regular classes of matrices. 99-101 - Raul Cordovil, Pierre Duchet:
Separation par une droite dans les matroïdes orientes de rang 3. 103-104 - János Körner, Victor K. Wei:
Addendum to "odd and even hamming spheres also have minimum boundary". 105-106 - Iwao Sato:
Clique graphs of packed graphs. 107-109
Volume 62, Number 2, November 1986
- Yousef Alavi, Gary Chartrand, Ortrud R. Oellermann, Linda M. Lesniak:
Bipartite regulation numbers. 113-118 - Roland Assous:
Enchainabilite et seuil de monomorphie des tournois n-aires. 119-125 - David W. Barnette:
Wv paths in the projective plane. 127-131 - Zhanna A. Chernyak, Arkady A. Chernyak:
About recognizing (alpha, beta) classes of polar. 133-138 - Cees Roos, A. J. van Zanten, M. J. Coster:
On the existence of certain generalized moore geometries (Part IV). 139-144 - Pierre Duchet, Michel Las Vergnas, Henry Meyniel:
Connected cutsets of a graph and triangle bases of the cycle space. 145-154 - Reinhardt Euler, Rainer E. Burkard, R. Grommes:
On latin squares and the facial structure of related polytopes. 155-181 - Alan Hartman:
Partial triple systems and edge colourings. 183-196 - Esther R. Lamken, Scott A. Vanstone:
Existence results for KS3(v; 2, 4)s. 197-210 - Derek K. Chang:
Permanents of doubly stochastic matrices. 211-213 - Nachum Dershowitz, Shmuel Zaks:
Ordered trees and non-crossing partitions. 215-218 - A. Panayotopoulos:
Generating stable permutations. 219-221
Volume 62, Number 3, December 1986
- Richard P. Anstee, Zoltán Füredi:
Forbidden submatrices. 225-243 - Hans-Jürgen Bandelt, Henry Martyn Mulder:
Pseudo-modular graphs. 245-260 - Dominique Bénard, André Bouchet, Jean-Luc Fouquet:
(m)-covering of a triangulation. 261-270 - Béla Bollobás, Chie Nara, Shun-ichi Tachibana:
The maximal number of induced complete bipartite graphs. 271-275 - Olof Heden:
Maximal partial spreads and two-weight codes. 277-293 - David Klarner:
The number of tiered posets modulo six. 295-297 - Seiya Negami:
Enumeration of projective-planar embeddings of graphs. 299-306 - Peter J. Cameron:
Regular orbits of permutation groups on the power set. 307-309 - Peter Frankl:
What must be contained in every oriented k-uniform hypergraph. 311-313 - Bernd Sturmfels:
Central and parallel projections of polytopes. 315-318 - Hiroshi Umeo, Isao Nakatsuka:
A pipeline-interval-optimum systolic queue. 319-323 - Gerald L. Alexanderson, John E. Wetzel:
On d-arrangements associated with a simplex. 325-328 - András Gyárfás:
Corrigendum. 333
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-01-08 20:20 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:
