Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Combinatorial Theory, Series B, Volume 52
Volume 52, Number 1, May 1991
- Ding-Zhu Du, D. Frank Hsu, Frank K. Hwang, X. M. Zhang:
The Hamiltonian property of generalized de Bruijn digraphs. 1-8 - Anthony J. W. Hilton:
The total chromatic number of nearly complete bipartite graphs. 9-19 - Yoshimi Egawa, R. Glas, Stephen C. Locke
:
Cycles and paths through specified vertices in k-connected graphs. 20-29 - Gena Hahn, Eric C. Milner, Robert E. Woodrow:
Infinite friendship graphs with infinite parameters. 30-41 - Bert Fassbender:
On a generalization of a theorem of Nash-Williams. 42-44 - Jason I. Brown, Vojtech Rödl:
A ramsey type problem concerning vertex colourings. 45-52 - Jan Kratochvíl:
String graphs. I. The number of critical nonstring graphs is infinite. 53-66 - Jan Kratochvíl:
String graphs. II. recognizing string graphs is NP-hard. 67-78 - Yair Caro, Zsolt Tuza:
Hypergraph coverings and local colorings. 79-85 - Igor Kríz, Robin Thomas:
The menger-like property of the tree-width of infinite graphs. 86-91 - Zsolt Tuza:
Extensions of Gallai's graph covering theorems for uniform hypergraphs. 92-96 - Jaroslav Ivanco:
An interpolation theorem for partitions which are indivisible with respect to cohereditary properties. 97-101 - Miroslav Petrovic:
On graphs with exactly one eigenvalue less than -1. 102-112 - Rephael Wenger:
Extremal graphs with no C4's, C6's, or C10's. 113-116 - Stanislav Riha:
A new proof of the theorem by Fleischner. 117-123 - Jozef Sirán, Martin Skoviera:
Characterization of the maximum genus of a signed graph. 124-146 - Alice M. Dean, Joan P. Hutchinson, Edward R. Scheinerman:
On the thickness and arboricity of a graph. 147-151
Volume 52, Number 2, July 1991
- Neil Robertson, Paul D. Seymour:
Graph minors. X. Obstructions to tree-decomposition. 153-190 - Saul Stahl:
Permutation-partition pairs. III. Embedding distributions of linear families of graphs. 191-218 - Saul Stahl:
An upper bound for the average number of regions. 219-221 - Norbert Seifter:
Properties of graphs with polynomial growth. 222-235 - Zhi-Cheng Gao:
The number of rooted triangular maps on a surface. 236-249 - Haluk Oral:
Constructing self-dual codes using graphs. 250-258 - François Jaeger:
Even subgraph expansions for the flow polynomial of cubic plane maps. 259-273 - Daniel Bienstock, Neil Robertson, Paul D. Seymour, Robin Thomas:
Quickly excluding a forest. 274-283 - Wayne Goddard, Grzegorz Kubicki, Ortrud R. Oellermann, Songlin Tian:
On multipartite tournaments. 284-300 - Safwan Akkari, James G. Oxley:
Some extremal connectivity results for matroids. 301-320
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-22 20:02 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:
