![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Journal of Combinatorial Theory, Series B, Volume 58
Volume 58, Number 1, May 1993
- Hanno Lefmann, Vojtech Rödl:
On Canonical Ramsey Numbers for Complete Graphs versus Paths. 1-13 - G. E. Farr:
A Correlation Inequality Involving Stable Set and Chromatic Polynomials. 14-21 - Paul D. Seymour
, Robin Thomas:
Graph Searching and a Min-Max Theorem for Tree-Width. 22-33 - Douglas A. Leonard, Kazuamsa Nomura:
The Girth of a Directed Distance-Regular Graph. 34-39 - Guoli Ding, Alexander Schrijver, Paul D. Seymour
:
Disjoint Cycles in Directed Graphs on the Torus and the Klein Bottle. 40-45 - Dragan Marusic
, Raffaele Scapellato:
Imprimitive Representations of SL(2, 2k). 46-57 - Douglas B. West:
Generating Linear Extensions by Adjacent Transpositions. 58-64 - Alexander Schrijver:
Tait's Flyping Conjecture for Well-Connected Links. 65-146 - Alexander Schrijver:
Graphs on the Torus and Geometry of Numbers. 147-158
Volume 58, Number 2, July 1993
- Joseph E. Bonin
:
Automorphism Groups of Higher-Weight Dowling Geometries. 161-173 - András Sebö:
General Antifactors of Graphs. 174-184 - A. F. Sidorenko:
The Ramsey Number of an N-Edge Graph versus Triangle Is at Most 2N + 1. 185-196 - Ru-Ji Wang, Ming Yao Xu:
A Classification of Symmetric Graphs of Order 3p. 197-216 - R. Bruce Richter, Carsten Thomassen:
Minimal Graphs with Crossing Number at Least k. 217-224 - Mao-cheng Cai:
The Number of Vertices of Degree k in a Minimally k-Edge-Connected Graph. 225-239 - Werner Schwärzler:
The Coefficients of the Tutte Polynomial Are Not Unimodal. 240-242 - Kazumasa Nomura:
Some Inequalities in Distance-Regular Graphs. 243-247 - Carsten Thomassen, Wolfgang Woess:
Vertex-Transitive Graphs and Accessibility. 248-268 - Jian Ji Su:
Fragments in 2-Critically n-Connected Graphs. 269-279 - Bhalchandra D. Thatte:
On the Nash-Williams' Lemma in Graph Reconstruction Theory. 280-290 - Vojtech Rödl, Bernd Voigt:
Monochromatic Trees with Respect to Edge Partitions. 291-298 - Cheryl E. Praeger
, Ru-Ji Wang, Ming Yao Xu:
Symmetric Graphs of Order a Product of Two Distinct Primes. 299-318 - Gregory Z. Gutin:
On Cycles in Multipartite Tournaments. 319-321
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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.