default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGraphs and Combinatorics, Volume 9
Volume 9, Number 1, March 1993
- Jin Akiyama:
From the managing editor. 1 - Haitze J. Broersma, Jan van den Heuvel, Heinz Adolf Jung, Henk Jan Veldman:
Long paths and cycles in tough graphs. 3-17 - C. De Simone:
On the vertex packing problem. 19-30 - Luisa Gargano
, János Körner, Ugo Vaccaro:
Sperner capacities. 31-46 - Hadi Kharaghani, Jennifer Seberry:
The excess of complex Hadamard matrices. 47-56 - Martin Loebl:
Gadget classification. 57-62 - Claudia Malvenuto:
P-Partitions and the plactic congruence. 63-73 - Andrew Vince:
The classification of closed surfaces using colored graphs. 75-84 - Mariusz Wozniak, A. Pawel Wojda:
Triple placement of graphs. 85-91 - Hiroshi Iwane:
Symmetric Association Schemes of Class 2. 93-94
Volume 9, Numbers 2-4, June 1993
- Imre Bárány, Peter Frankl, Hiroshi Maehara:
Reflecting a triangle in the plane. 97-104 - Elizabeth J. Billington, Ebadollah S. Mahmoodian:
Multi-Set designs and numbers of common triples. 105-115 - C. Coker:
A problem related to Foulkes's conjecture. 117-134 - Michel Deza, Monique Laurent, Svatopluk Poljak:
The cut cone III: On the role of triangle facets. 135-152 - Jonathan L. Gross, E. Ward Klein, Robert G. Rieper:
On the average genus of a graph. 153-162 - Laurent Habsieger, Dennis Stanton:
More zeros of krawtchouk polynomials. 163-172 - Alain Hertz:
Most unbreakable murky graphs are bull-free. 173-175 - Bruce M. Landman:
An upper bound for van der Waerden-like numbers using k colors. 177-184 - Jennifer Seberry, Xian-Mo Zhang:
Regular sets of matrices and applications. 185-195 - Jeffrey O. Shallit:
On the maximum number of distinct factors of a binary string. 197-200 - Alexander F. Sidorenko:
A correlation inequality for bipartite graphs. 201-204 - Janez Zerovnik, Jolana Oplerova:
A counterexample to conjecture of Barefoot, Harary, and Jones. 205-207 - Ron Aharoni:
On a criterion for matchability in hypergraphs. 209-212 - Laura M. Chihara:
Askey-Wilson polynomials, kernel polynomials and association schemes. 213-223 - Miles Hoare:
Triplets and Hexagons. 225-233 - Alexandr V. Kostochka:
The independent domination number of a cubic 3-connected graph can be much larger than its domination number. 235-237 - Grzegorz Kubicki:
Planar graphs and greatest common subgraphs. 239-253 - M. L. Narayana Rao, K. Kuppuswamy Rao, Vinod Joshi:
A translation plane of order 72 with a very small translation complement. 255-263 - Douglas G. Rogers:
On the BKT inequality and improved bounds for perfect systems of difference sets. 265-278 - Joseph M. Santmyer:
Five discordant permutations. 279-292 - John Howard Smith:
Combinatorial congruences from p -subgroups of the symmetric group. 293-304 - Stefan A. Burr, Ralph J. Faudree:
On graphsG for which all large trees areG-good. 305-313 - Weizhen Gu:
On minimal embedding of two graphs as center and periphery. 315-323 - Jacobus H. Koolen:
On uniformly geodetic graphs. 325-333 - Erich Prisner:
The dynamics of the line and path graph operators. 335-352 - Zdzislaw Skupien:
The complete graph t -packings and t -coverings. 353-363 - Tiong-Seng Tay:
A new proof of laman's theorem. 365-370 - Jerzy Topp, Preben D. Vestergaard:
Odd factors of a graph. 371-381 - Bing Wei:
A generalization of a result of Bauer and Schmeichel. 383-389 - Yue Zhao:
On the edge reconstruction of graphs embedded on surfaces. 391-395
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-12-09 00:12 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:
