default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Combinatorial Theory, Series B, Volume 50
Volume 50, Number 1, October 1990
- Ron Aharoni, E. C. Milner, Karel Prikry:
Unfriendly partitions of a graph. 1-10 - Yves Colin de Verdière:
Sur un nouvel invariant des graphes et un critère de planarité. 11-21 - Myriam Preissmann:
Locally perfect graphs. 22-40 - Joseph P. S. Kung:
The long-line graph of a combinatorial geometry. II. Geometries representable over two fields of different characteristics. 41-53 - Gil Kalai:
Symmetric matroids. 54-64 - Luis A. Goddyn:
Quantizers and the worst-case Euclidean traveling salesman problem. 65-81 - Ron Aharoni, Ran Ziv:
LP duality in infinite hypergraphs. 82-92 - Reinhard Diestel:
Simplicial tree-decompositions of infinite graphs. II. The existence of prime decompositions. 93-116 - Reinhard Diestel:
Simplicial tree-decompositions of infinite graphs. III. The uniqueness of prime decompositions. 117-128 - Feng-Chu Lai, Gerard J. Chang
:
An upper bound for the transversal numbers of 4-uniform hypergraphs. 129-133
Volume 50, Number 2, December 1990
- David B. Surowski:
Lifting map automorphisms and MacBeath's theorem. 135-149 - Éva Tardos:
An intersection theorem for supermatroids. 150-159 - Kazumasa Nomura:
Distance-regular graphs of hamming type. 160-167 - Ron Aharoni, Mao Lin Zheng:
Counting 1-factors in infinite graphs. 168-178 - Elke Wilkeit:
Isometric embeddings in Hamming graphs. 179-197 - Carsten Thomassen:
Bidirectional retracting-free double tracings and upper embeddability of graphs. 198-207 - Marion Alfter, Walter Kern, Alfred Wanka:
On adjoints and dual matroids. 208-213 - Kazumasa Nomura:
Intersection diagrams of distance-biregular graphs. 214-221 - Marc E. Bertschi:
Perfectly contractile graphs. 222-230 - Alain Hertz:
A fast algorithm for coloring Meyniel graphs. 231-240 - Yahya Ould Hamidoune:
On the numbers of independent k-sets in a claw free graph. 241-244 - Herbert Fleischner, András Frank:
On circuit decomposition of planar Eulerian graphs. 245-253 - Denise Amar, Yannis Manoussakis:
Cycles and paths of many lengths in bipartite digraphs. 254-264 - Jon Lee:
The incidence structure of subspaces with well-scaled frames. 265-287 - Li Jiongsheng, Huang Daode, Pan Qun:
Digraphs with degree equivalent induced subdigraphs. 288-298 - W. Bienia, I. P. da Silva:
On the inversion of the sign of one basis in an oriented matroid. 299-308 - Béla Bollobás, Roland Häggkvist:
Powers of Hamilton cycles in tournaments. 309-318 - Shaoji Xu:
The size of uniquely colorable graphs. 319-320 - Peter Horák:
A coloring problem related to the Erdös-Faber-Lovász conjecture. 321-322
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 2026-05-17 00:03 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:
