default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGraphs and Combinatorics, Volume 4
Volume 4, Number 1, December 1988
- Lars Døvling Andersen, Herbert Fleischner, Bill Jackson:
Removable edges in cyclically 4-edge-connected cubic graphs. 1-21 - Fred Buckley, Frank Harary:
On the euclidean dimension of a wheel. 23-30 - Michel Deza, N. M. Singhi:
Rigid pentagons in hypercubes. 31-42 - Hiroshi Maehara, Jan Reiterman, Vojtech Rödl, Edita Sinajová:
Embedding of trees in euclidean spaces. 43-47 - Amram Meir, John W. Moon:
Survival under random coverings of trees. 49-65 - Alan Rahilly:
Divisions of symmetric designs into two parts. 67-73 - Sam Stueckle:
On natural isomorphisms of cycle permutation graphs. 75-85 - Paul M. Terwilliger:
Balanced sets andQ-polynomial association schemes. 87-94 - Robert Chen, Frank K. Hwang:
Stronger players win more balanced knockout tournaments. 95-99 - Ernest J. Cockayne, P. H. Spencer:
On the independent queens covering problem. 101-110 - Hikoe Enomoto, Takashi Miyamoto, Kazuhiko Ushio:
Ck-factorization of complete bipartite graphs. 111-113 - Zoltán Füredi:
Matchings and covers in hypergraphs. 115-206 - David Avis, Paul Erdös, János Pach:
Repeated distances in space. 207-217 - Eiichi Bannai, Tatsuro Ito:
On distance-regular graphs with fixed valency, II. 219-228 - Chris D. Godsil
, Richard J. Nowakowski, Jaroslav Nesetril:
The chromatic connectivity of graphs. 229-233 - Masatosi Imori, Makoto Matsumoto, Hisao Yamada:
The line digraph of a regular and pancircular digraph is also regular and pancircular. 235-239 - Esther R. Lamken, Scott A. Vanstone:
Orthogonal resolutions in odd balanced tournament designs. 241-255 - Masataka Nakamura:
Structural theorems for submodular functions, polymatroids and polymatroid intersections. 257-284 - Douglas G. Rogers:
Irregular, extremal perfect systems of difference sets II. 285-295 - Mieko Yamada:
On a series of Hadamard matrices of order 2t and the maximal excess of Hadamard matrices of order 22t. 297-301 - Noga Alon, Z. Bregman:
Every 8-uniform 8-regular hypergraph is 2-colorable. 303-306 - Martin Charles Golumbic:
Algorithmic aspects of intersection graphs and representation hypergraphs. 307-321 - Joseph P. S. Kung, James G. Oxley:
Combinatorial geometries representable over GF(3) and GF(q). II. Dowling geometries. 323-332 - Katsuhiro Ota:
The number of contractible edges in 3-connected graphs. 333-354 - Jennifer Seberry, Albert Leon Whiteman:
New Hadamard matrices and conference matrices obtained via Mathon's construction. 355-377 - N. Srinivasan, Jaroslav Opatrny, Vangalur S. Alagar:
Bigeodetic graphs. 379-392 - László Pyber:
Finding defective coins. 393-394
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-21 20:19 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:
