Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Combinatorial Theory, Series B, Volume 53
Volume 53, Number 1, September 1991
- Jan Kratochvíl
, Jirí Matousek:
String graphs requiring exponential representations. 1-4
- Hans-Jürgen Bandelt, Erwin Pesch:
Efficient characterizations of n-chromatic absolute retracts. 5-31 - Alexander Schrijver:
Short proofs on multicommodity flows and cuts. 32-39 - Gert Sabidussi:
Clumps, minimal asymmetric graphs, and involutions. 40-79 - Bill Jackson:
A characterisation of graphs having three pairwise compatible Euler tours. 80-92 - Bill Jackson:
Supplementary Eulerian vectors in isotropic systems. 93-105 - Brigitte Servatius:
On the two-dimensional generic rigidity matroid and its dual. 106-113 - Joseph Douglas Horton, I. Z. Bouwer:
Symmetric Y-graphs and H-graphs. 114-129 - Zhi-Cheng Gao:
The number of rooted 2-connected triangular maps on the projective plane. 130-142 - Noga Alon, Richard A. Brualdi, Bryan L. Shader:
Multicolored forests in bipartite decompositions of graphs. 143-148
Volume 53, Number 2, November 1991
- Anna Lubiw:
A weighted min-max relation for intervals. 151-172 - F. Bruce Shepherd:
Hamiltonicity in claw-free graphs. 173-194 - Peter Frankl:
Multiply-intersecting families. 195-234 - Reinhardt Euler, Ali Ridha Mahjoub:
On a composition of independence systems by circuit identification. 235-259 - Wolfgang Mader:
Ecken von kleinem Grad in kritisch n-fach zusammenhängenden Digraphen. 260-272 - Liping Sun:
Two classes of perfect graphs. 273-292 - Edward A. Bender, E. Rodney Canfield:
The number of rooted maps on an orientable surface. 293-299 - James B. Shearer:
A note on the independence number of triangle-free graphs, II. 300-307
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 2023-03-30 00:34 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:
