


default search action
Graphs and Combinatorics, Volume 7
Volume 7, Number 1, March 1991
- Noga Alon, András Hajnal:

Ramsey graphs contain many distinct induced subgraphs. 1-6 - Neal Brand:

Polynomial isomorphisms of combinatorial objects. 7-14 - Yoshimi Egawa:

Contractible edges inn-connected graphs with minimum degree greater than or equal to [5n/4]. 15-21 - Peter Frankl:

Shadows and shifting. 23-29 - Ervin Györi, János Pach, Miklós Simonovits:

On the maximal number of certain subgraphs inKr-free graphs. 31-37 - Wing Man Kwok:

Character table of a controlling association scheme defined by the general orthogonal groupO(3, q). 39-52 - Bojan Mohar:

Eigenvalues, diameter, and mean distance in graphs. 53-64 - Mark Ramras:

Symmetric edge-decompositions of hypercubes. 65-87 - Zsolt Tuza:

Perfect graph decompositions. 89-93
Volume 7, Number 2, June 1991
- Noga Alon, Daniel J. Kleitman, Richard J. Lipton, Roy Meshulam, Michael O. Rabin, Joel H. Spencer:

Set systems with no union of cardinality 0 modulom. 97-99 - Denise Amar, Irène Fournier, Anne Germa:

Pancyclism in Chvátal-Erdös's graphs. 101-112 - Jürgen Bierbrauer:

Weighted arcs, the finite radon transform and a Ramsey problem. 113-118 - Jean-Luc Fouquet, Henri Thuillier:

Non removable edges in 3-connected cubic graphs. 119-141 - Yahya Ould Hamidoune, Anna S. Lladó

, Oriol Serra
:
Vosperian and superconnected Abelian Cayley digraphs. 143-152 - Julie Haviland, Andrew Thomason:

Rotation numbers for complete tripartite graphs. 153-163 - Ilia Krasikov:

Interchanging branches and similarity in a tree. 165-175 - Fred R. McMorris, Edward R. Scheinerman:

Connectivity threshold for random chordal graphs. 177-181 - Chihiro Suetake:

Flag transitive planes of orderqn with a long cyclel∞ as a collineation. 183-195 - Preben D. Vestergaard:

Graphs with two isomorphism classes of spanning unicyclic subgraphs. 197-204 - Curtiss Barefoot, Frank Harary, Kathryn Fraughnaugh Jones:

What is the difference between the domination and independent domination numbers of a cubic graph? 205-208
Volume 7, Number 3, September 1991
- K. T. Arasu, Dieter Jungnickel, Alexander Pott:

The mann test for divisible difference sets. 209-217 - Béla Bajnok:

Construction of spherical 4- and 5-designs. 219-233 - André Bouchet:

Tutte-martin polynomials and orienting vectors of isotropic systems. 235-252 - Gary Chartrand, S. F. Kapoor, Terry A. McKee, Farrokh Saba:

Edge-clique graphs. 253-264 - Stephen C. Locke

, Cun-Quan Zhang:
Cycles through three vertices in 2-connected graphs. 265-269 - Luz R. Nochefranca:

On an infinite class of non-bipartite and non-cayley graphs having 2-arc transitive automorphism groups. 271-275 - Ryuzaburo Noda:

An inequality for steiner systems. 277-278 - Tamás Szönyi:

Small complete arcs in andré planes of square order. 279-287 - Tiong-Seng Tay:

Linking (n - 2)-dimensional panels inn-space I: (k - 1, k)-graphs and (k - 1, k)-frames. 289-304
Volume 7, Number 4, December 1991
- Gerard J. Chang

:
Centers of chordal graphs. 305-313 - Ronald D. Dutton, Robert C. Brigham:

Edges in graphs with large girth. 315-321 - Andreas Huck:

A sufficient condition for graphs to be weaklyk-linked. 323-351 - Tadashi Iida, Tsuyoshi Nishimura:

An ore-type condition for the existence ofk-factors in graphs. 353-361 - Hiroshi Suzuki:

Bounding the diameter of a distance regular graph by a function ofkd. 363-375 - John van Bon

:
On distance-transitive graphs and involutions. 377-394 - Geoffrey Exoo:

A bipartite Ramsey number. 395-396

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.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














