default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGraphs and Combinatorics, Volume 5
Volume 5, Number 1, December 1989
- Gary Chartrand, Ortrud R. Oellermann, Farrokh Saba, Hung Bin Zou:
Greatest common subgraphs with specified properties. 1-14 - Charles J. Colbourn, William R. Pulleyblank, Alexander Rosa:
Hybrid triple systems and cubic feedback sets. 15-28 - Margaret B. Cozzens, Fred S. Roberts
:
On dimensional properties of graphs. 29-46 - Konrad Engel, Péter L. Erdös:
Sperner families satisfying additional conditions and their convex hulls. 47-56 - Andrew Granville, Alexandros Moisiadis, Rolf S. Rees:
On complementary decompositions of the complete graph. 57-61 - Noboru Hamada:
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. 63-81 - Chính T. Hoàng, Frédéric Maffray:
Opposition graphs are strict quasi-parity graphs. 83-85 - Stuart G. Hoggar:
Tight 4 and 5-designs in projective spaces. 87-94 - Noga Alon, Zoltán Füredi:
Legitimate colorings of projective planes. 95-106 - Jean-Claude Bermond, Nathalie Homobono, Claudine Peyrat:
Large fault-tolerant interconnection networks. 107-123 - Warwick de Launey:
GBRD's: Some new constructions for difference matrices, generalised hadamard matrices and balanced generalised weighing matrices. 125-135 - Noboru Hamada:
Characterization of {vμ+1 + 2vμ, vμ + 2vμ - 1;t, q}-min · hypers and its applications to error-correcting codes. 137-147 - Alain Hertz:
Slim graphs. 149-157 - Makoto Matsumoto, Norihide Tokushige:
A generalization of the katona theorem for crosst-intersecting families. 159-171 - Y. H. Peng, C. C. Chen, Khee Meng Koh:
On the factor-thickness of regular graphs. 173-188 - Sze-Chin Shee:
Some extensions of a hypergraph. 189-196 - Chu Wenchang:
A partition identity on binomial coefficients and its applications. 197-200 - Sein Win:
On a connection between the existence ofk-trees and the toughness of a graph. 201-205 - Brian Alspach, Guizhen Liu:
Paths and cycles in matroid base graphs. 207-211 - James Burling, Katherine Heinrich:
Near 2-factorizations of 2Kn: Cycles of even length. 213-221 - Teluhiko Hilano:
Distance degrees of vertex-transitive graphs. 223-228 - Noboru Ito:
On spectra of doubly regular asymmetric digraphs ofRH-type. 229-234 - Hiroshi Kimura:
New Hadamard matrix of order 24. 235-242 - Midori Kobayashi, Hitoshi Awoki, Yoshimi Nakazaki, Gisaku Nakamura:
A perfect one-factorization ofK36. 243-244 - Tiong-Seng Tay:
Linking (n - 2)-dimensional panels inn-space II: (n - 2, 2)-frameworks and body and hinge structures. 245-273 - Yohei Yamasaki:
Shannon switching games without terminals II. 275-282 - Yongjin Zhu, Hao Li, Xiaotie Deng:
Implicit-degrees and circumferences. 283-290 - Eiichi Bannai, Sung-Yell Song:
On the character table of the association schemeSp(4, q)/Sz(q). 291-293 - Peter Frankl:
Traces of antichains. 295-299 - Peter Alles, Svatopluk Poljak:
Long induced paths and cycles in Kneser graphs. 303-306 - Noga Alon, Yair Caro, Zsolt Tuza:
Sub-Ramsey numbers for arithmetic progressions. 307-314 - John H. Conway, Neil J. A. Sloane, Allan R. Wilks:
Gray codes for reflection groups. 315-325 - Zoltán Füredi, Jerrold R. Griggs, Daniel J. Kleitman:
A minimal cutset of the boolean lattice with almost all members. 327-332 - Chris D. Godsil, Wilfried Imrich, Norbert Seifter, Mark E. Watkins, Wolfgang Woess:
A note on bounded automorphisms of infinite graphs. 333-338 - Ryan Hayward, Chính T. Hoàng, Frédéric Maffray:
Optimizing weakly triangulated graphs. 339-349 - Midori Kobayashi:
On perfect one-factorization of the complete graphK2p. 351-353 - Siu Lun Ma:
Schur rings and cyclic association schemes of class three. 355-361 - Eric C. Milner, Robert E. Woodrow:
On directed graphs with an independent covering set. 363-369 - Masataka Nakamura:
A note on binary fundamental transversal matroids. 371-372 - Jennifer Seberry:
SBIBD(4k2, 2k2 +k, k2 +k) and Hadamard matrices of order 4k2 with maximal excess are equivalent. 373-383 - Kazuhiko Ushio, Reiji Tsuruno:
P3-factorization of complete multipartite graphs. 385-387 - Gil Kalai:
The number of faces of centrally-symmetric polytopes. 389-391
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-28 22: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:
