Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Combinatorial Theory, Series B, Volume 47
Volume 47, Number 1, August 1989
- Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Richard H. Schelp:
Neighborhood unions and hamiltonian properties in graphs. 1-9 - Achim Bachem, Alfred Wanka:
Euclidean intersection properties. 10-19 - Charles J. Colbourn, William R. Pulleyblank:
Matroid Steiner problems, the Tutte polynomial and network reliability. 20-31 - Thomas Zaslavsky
:
Biased graphs. I. Bias, balance, and gains. 32-52 - Allen J. Schwenk:
Enumeration of Hamiltonian cycles in certain generalized Petersen graphs. 53-59 - Marston D. E. Conder, Peter J. Lorimer:
Automorphism groups of symmetric graphs of valency 3. 60-72 - Paul Erdös, János Pach, Richard Pollack, Zsolt Tuza:
Radius, diameter, and minimum degree. 73-79 - Geoff Whittle:
Dowling group geometries and the critical problem. 80-92 - Jean-Pierre Roudneff, Marc Wagowski:
Characterizations of ternary matroids in terms of circuit signatures. 93-106 - Komei Fukuda, Akihisa Tamura:
Characterizations of *-families. 107-110 - Christophe Champetier:
Kernels in some orientations of comparability graphs. 111-113 - Noga Alon, Nathan Linial:
Cycles of length 0 modulo k in directed graphs. 114-119 - Kazumasa Nomura:
On local structure of a distance-regular graph of Hamming type. 120-123
Volume 47, Number 2, October 1989
- Andrew D. Barbour, Michal Karonski, Andrzej Rucinski:
A central limit theorem for decomposable random variables with applications to random graphs. 125-145 - Yahya Ould Hamidoune, Isabelle Salaün:
On the independence numbers of a matroid. 146-152 - Noga Alon, Yair Caro, Ilia Krasikov, Yehuda Roditty:
Combinatorial reconstruction problems. 153-161 - Mohamed M. El-Zahar, Norbert Sauer:
The indivisibility of the homogeneous Kn-free graphs. 162-170 - Min Aung:
Longest cycles in triangle-free graphs. 171-186 - Stephan Olariu:
The Strong Perfect Graph Conjecture for pan-free graphs. 187-191 - Robert M. Freund:
Combinatorial analogs of Brouwer's fixed-point theorem on a bounded polyhedron. 192-219 - Akira Saito:
Long cycles through specified vertices in a graph. 220-230 - John A. Hertz:
Slender graphs. 231-236 - Douglas Bauer, Hajo Broersma, Henk Jan Veldman, Li Rao:
A generalization of a result of Häggkvist and Nicoghossian. 237-243 - Henry Meyniel, Stephan Olariu:
A new conjecture about minimal imperfect graphs. 244-247
Volume 47, Number 3, December 1989
- Andrew Vince, Charles H. C. Little:
Discrete Jordan Curve Theorems. 251-261 - Steve Wilson:
Cantankerous maps and rotary embeddings of Kn. 262-273 - Bojan Mohar:
Isoperimetric numbers of graphs. 274-291 - Jonathan L. Gross, David P. Robbinsand, Thomas W. Tucker:
Genus distributions for bouquets of circles. 292-306 - Edwin C. Ihrig:
The structure of the symmetry groups of perfect 1-factorizations of K2n. 307-329 - A. M. H. Gerards:
A min-max relation for stable sets in graphs with no odd-K4. 330-348 - Detlef Seese, W. Wessel:
Grids and their minors. 349-360 - Wolfgang Woess:
Graphs and groups with tree-like properties. 361-371 - Dongfang Zhao:
Extremal non-bipartite regular graphs of girth 4. 372-373
a service of 
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-04-18 21:19 CEST 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:
