default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Combinatorial Theory, Series B, Volume 56
Volume 56, Number 1, September 1992
- Jan Reiterman, Vojtech Rödl, Edita Sinajová:
On embedding of graphs into euclidean spaces of small dimension. 1-8 - Vasilis Capoyleas, János Pach:
A turán-type theorem on chords of a convex polygon. 9-15 - William McCuaig:
Edge reductions in cyclically k-connected cubic graphs. 16-44 - André Bouchet:
A characterization of unimodular orientations of simple graphs. 45-54 - Tomasz Luczak
, Andrzej Rucinski, Bernd Voigt:
Ramsey properties of random graphs. 55-68 - Paul D. Seymour:
On secret-sharing matroids. 69-73 - Cun-Quan Zhang, Yongjin Zhu:
Factorizations of regular graphs. 74-89 - Jörg Rieder:
A note on the f-factor-lattice of bipartite graphs. 90-96 - S. E. Markosian, G. S. Gasparian, A. S. Markosian:
On a conjecture of berge. 97-107 - Jianer Chen, Jonathan L. Gross:
Limit points for average genus II. 2-Connected non-simplicial graphs. 108-129 - Collette R. Coullard, James G. Oxley:
Extensions of Tutte's wheels-and-whirls theorem. 130-140 - Péter Komjáth:
Martin's axiom and spanning trees of infinite graphs. 141-144
Volume 56, Number 2, November 1992
- Aleksander Malnic, Bojan Mohar:
Generating locally cyclic triangulations of surfaces. 147-164 - François Jaeger, Nathan Linial, Charles Payan, Michael Tarsi:
Group connectivity of graphs - A nonhomogeneous analogue of nowhere-zero flow properties. 165-182 - Kenneth A. Berman, Jerome L. Paul:
The bounded chromatic number for graphs of genus g. 183-196 - Ury Jamshy, Michael Tarsi:
Short cycle covers and the cycle double cover conjecture. 197-204 - Chris D. Godsil, A. D. Hensel:
Distance regular covers of the complete graph. 205-238 - Patrick Solé:
The second eigenvalue of regular graphs of given girth. 239-249 - W. C. Stephen Suen:
On large induced trees and long induced paths in sparse random graphs. 250-262 - Reinhard Diestel:
On spanning trees and k-connectedness in infinite graphs. 263-277 - Peter C. Fishburn, William T. Trotter:
Dimensions of hypergraphs. 278-295 - Ingo Althöfer, Torsten Sillke:
An "average distance" inequality for large subsets of the cube. 296-301
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 2024-11-25 22:43 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:
