Greatest common subgraphs with specified properties Gary ChartrandOrtrud R. OellermannHung Bin Zou OriginalPaper Pages: 1 - 14
Hybrid triple systems and cubic feedback sets Charles J. ColbournWilliam R. PulleyblankAlexander Rosa OriginalPaper Pages: 15 - 28
On dimensional properties of graphs Margaret Barry CozzensFred S. Roberts OriginalPaper Pages: 29 - 46
Sperner families satisfying additional conditions and their convex hulls Konrad EngelPéter L. Erdös OriginalPaper Pages: 47 - 56
On complementary decompositions of the complete graph Andrew GranvilleAlexandros MoisiadisRolf Rees OriginalPaper Pages: 57 - 61
Characterization of {(q + 1) + 2, 1;t, q}-min · hypers and {2(q + 1) + 2, 2; 2,q}-min · hypers in a Finite projective geometry Noboru Hamada OriginalPaper Pages: 63 - 81
Large fault-tolerant interconnection networks J. -C. BermondN. HomobonoC. Peyrat OriginalPaper Pages: 107 - 123
GBRD's: Some new constructions for difference matrices, generalised hadamard matrices and balanced generalised weighing matrices Warwick de Launey OriginalPaper Pages: 125 - 135
Characterization of {v μ+1 + 2v μ,v μ + 2v μ − 1;t,q}-min · hypers and its applications to error-correcting codes Noboru Hamada OriginalPaper Pages: 137 - 147
A generalization of the katona theorem for crosst-intersecting families Makoto MatsumotoNorihide Tokushige OriginalPaper Pages: 159 - 171
On the factor-thickness of regular graphs Y. H. PengC. C. ChenK. M. Koh OriginalPaper Pages: 173 - 188
A partition identity on binomial coefficients and its applications Chu Wenchang OriginalPaper Pages: 197 - 200
On a connection between the existence ofk-trees and the toughness of a graph Sein Win OriginalPaper Pages: 201 - 205
Near 2-factorizations of 2K n : Cycles of even length James BurlingKatherine Heinrich OriginalPaper Pages: 213 - 221
A perfect one-factorization ofK 36 Midori KobayashiHitoshi AwokiGisaku Nakamura OriginalPaper Pages: 243 - 244
Linking (n − 2)-dimensional panels inn-space II: (n − 2, 2)-frameworks and body and hinge structures Tiong-Seng Tay OriginalPaper Pages: 245 - 273
On the character table of the association schemeSp(4, q)/Sz(q) Eiichi BannaiSung-Yell Song Research Problems Pages: 291 - 293
Long induced paths and cycles in Kneser graphs Peter AllesSvatopluk Poljak OriginalPaper Pages: 303 - 306
Sub-Ramsey numbers for arithmetic progressions Noga AlonYair CaroZsolt Tuza OriginalPaper Pages: 307 - 314
Gray codes for reflection groups J. H. ConwayN. J. A. SloaneAllan R. Wilks OriginalPaper Pages: 315 - 325
A minimal cutset of the boolean lattice with almost all members Zoltán FürediJerrold R. GriggsDaniel J. Kleitman OriginalPaper Pages: 327 - 332
A note on bounded automorphisms of infinite graphs Chris D. GodsilWilfried ImrichWolfgang Woess OriginalPaper Pages: 333 - 338
Optimizing weakly triangulated graphs Ryan HaywardChính HoàngFrédéric Maffray OriginalPaper Pages: 339 - 349
On perfect one-factorization of the complete graphK 2p Midori Kobayashi OriginalPaper Pages: 351 - 353
On directed graphs with an independent covering set E. C. MilnerRobert E. Woodrow OriginalPaper Pages: 363 - 369
SBIBD(4k 2, 2k 2 +k,k 2 +k) and Hadamard matrices of order 4k 2 with maximal excess are equivalent Jennifer Seberry OriginalPaper Pages: 373 - 383
P 3-factorization of complete multipartite graphs Kazuhiko UshioReiji Tsuruno OriginalPaper Pages: 385 - 387
