default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGraphs and Combinatorics, Volume 2
Volume 2, Number 1, December 1986
- Brian Alspach, Moshe Rosenfeld:
On Hamilton decompositions of prisms over simple 3-polytopes. 1-8 - Tetsuo Asano:
Generating and counting valid patterns in routes between two points. 9-13 - Bhagwandas, Sanpei Kageyama, Rahul Mukerjee:
Symmetry and classification of certain regular group divisible designs. 15-20 - Andries E. Brouwer:
Uniqueness and nonexistence of some graphs related toM22. 21-29 - Fan R. K. Chung, Peter C. Fishburn, Victor K. Wei:
Monotone subsequences in (0, 1)-matrices. 31-36 - Hikoe Enomoto:
Toughness and the existence ofk-factors. II. 37-42 - Peter D. Johnson Jr., Douglas G. Rogers:
Compatible additive permutations of finite integral bases. 43-53 - Péter Komjáth, Vojtech Rödl:
Coloring of universal graphs. 55-60 - Pierre Fraisse, Pavol Hell, David G. Kirkpatrick:
A note onf-factors in directed and undirected multigraphs. 61-66 - Zoltán Füredi:
t-expansive andt-wise intersecting hypergraphs. 67-80 - Jennifer Seberry:
A new construction for Williamson-type matrices. 81-87 - Zoltán Füredi:
The chromatic index of simple hypergraphs. 89-92 - Noga Alon:
Decomposition of the completer-graph into completer-partiter-graphs. 95-100 - Laura M. Chihara, Dennis Stanton:
Association schemes and quadratic transformations for orthogonal polynomials. 101-112 - Paul Erdös, Peter Frankl, Vojtech Rödl:
The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent. 113-121 - Péter L. Erdös, Gyula O. H. Katona:
Convex hulls of more-part Sperner families. 123-134 - Peter Frankl, Vojtech Rödl:
Large triangle-free subgraphs in graphs withoutK4. 135-144 - Yiming Hong:
On the nonexistence of nontrivial perfecte-codes and tight 2e-designs in hamming schemesH(n, q) withe ≥ 3 andq ≥ 3. 145-164 - Zbigniew Palka
:
Rulers and slaves in a random social group. 165-172 - László Pyber:
How to find many counterfeit coins? 173-177 - Mieko Yamada:
Hadamard matrices generated by an adaptation of generalized quaternion type array. 179-187 - Paul Erdös:
Two problems in extremal graph theory. 189-190 - Francis T. Boesch, Helmut Prodinger:
Spanning tree formulas and chebyshev polynomials. 191-200 - Izak Broere, Marieta Burger:
Uniquely cocolourable graphs. 201-208 - Amanda G. Chetwynd, Anthony J. W. Hilton:
Critical star multigraphs. 209-221 - Yoshimi Egawa, Hikoe Enomoto, Akira Saito:
On component factors. 223-225 - Wenceslas Fernandez de la Vega:
Induced trees in sparse random graphs. 227-231 - Yoji Kajitani, Akio Ishizuka, Shuichi Ueno:
Characterization of partial 3-trees in terms of three structures. 233-246 - Hiroshi Kimura, Hiroyuki Ohmori:
Construction of hadamard matrices of order 28. 247-257 - Akihiro Munemasa:
An analogue oft-Designs in the association schemes of alternating bilinear forms. 259-267 - Jaroslav Nesetril, Vojtech Rödl:
On sets of integers with the Schur property. 269-275 - Ryuzaburo Noda:
On orthogonal arrays of strength 3 and 5 achieving Rao's bound. 277-282 - Dennis Stanton:
t-designs in classical association schemes. 283-286 - Eiichi Bannai, Tatsuro Ito:
Current research on algebraic combinatorics - Supplements to our Book, Algebraic Combinatorics I. 287-308 - Andries E. Brouwer, A. Robert Calderbank:
An Erdös-Ko-Rado theorem for regular intersecting families of octads. 309-316 - Charles J. Colbourn, Alexander Rosa:
Quadratic leaves of maximal partial triple systems. 317-337 - J. Csima, Zoltán Füredi:
Colouring finite incidence structures. 339-346 - Peter Horák, Jozef Sirán:
On a construction of Thomassen. 347-350 - Bruce M. Landman:
Generalized van der Waerden numbers. 351-356 - Jaroslav Nesetril, Vojtech Rödl:
Finite union theorem with restrictions. 357-361 - Ákos Seress:
Quick gossiping without duplicate transmissions. 363-381
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-20 23:00 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:
