Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Combinatorial Theory, Series B, Volume 31
Volume 31, Number 3, December 1981
- Joachim H. Ahrens:
A conjecture of E. D. Bolker. 1-8
- Jaroslav Nesetril, Svatopluk Poljak, Daniel Turzík:
Amalgamation of matroids and its applications. 9-22 - Laurent Chottin:
Énumération d'arbres et formules d'inversion de séries formellles. 23-45 - R. M. Damerell:
Distance-transitive and distance-regular digraphs. 46-53 - Beatrice Loerinc, Earl Glen Whitehead Jr.:
Chromatic polynomaials for regular graphs and modified wheels. 54-61 - Paul E. Blower Jr.:
The direct power of a 1-graph. 62-74 - Haruko Okamura, Paul D. Seymour:
Multicommodity flows in planar graphs. 75-81 - Paul D. Seymour:
On Tutte's extension of the four-colour problem. 82-94 - Michel Las Vergnas, Henry Meyniel:
Kempe classes and the Hadwiger Conjecture. 95-104 - Eiichi Bannai, Peter J. Cameron
, Jeff Kahn:
Nonexistence of certain distance-transitive digraphs. 105-110
- Béla Bollobás, Andrew Thomason:
Dense neighbourhoods and Turán's theorem. 111-114
Volume 31, Number 2, October 1981
- Cheryl E. Praeger:
Primitive permutation groups and a characterization of the odd graphs. 117-142 - S. Ramachandran:
On a new digraph reconstruction conjecture. 143-149 - Béla Bollobás, Carsten Thomassen:
The size of connected hypergraphs with prescribed covering number. 150-155 - Nicholas C. Wormald:
The asymptotic connectivity of labelled regular graphs. 156-167 - Nicholas C. Wormald:
The asymptotic distribution of short cycles in random regular graphs. 168-182 - Diana Schmidt:
The relation between the height of a well-founded partial ordering and the order types of its chains and antichains. 183-189 - Svatopluk Poljak, Vojtech Rödl:
On the arc-chromatic number of a digraph. 190-198 - Carsten Thomassen, Bjarne Toft:
Non-separating induced cycles in graphs. 199-224 - Brian Alspach, Peter J. Robinson, Moshe Rosenfeld:
A result on Hamiltonian cycles in generalized Petersen graphs. 225-231 - Paul K. Stockmeyer:
A census of non-reconstructable digraphs, I: Six related families. 232-239 - Ching-Shui Cheng:
Maximizing the total number of spanning trees in a graph: Two related problems in graph theory and optimum design theory. 240-248
- J.-C. Fournier:
A characterization of binary geometries by a double elimination axiom. 249-250 - Zsolt Baranyai, Gy. R. Szász:
Hamiltonian decomposition of lexicographic product. 253-261 - Jean-Luc Fouquet, Jean-Loup Jolivet, M. Rivière:
Graphes cubiques d'indice trois, graphes cubiques isochromatiques, graphes cubiques d'indice quatre. 262-281 - Mark K. Goldberg:
Construction of class 2 graphs with maximum vertex degree 3. 282-291 - Anton Kotzig:
Decompositions of complete graphs into isomorphic cubes. 292-296 - Denis Naddef, William R. Pulleyblank:
Hamiltonicity and combinatorial polyhedra. 297-312 - Rick Giles, Leslie E. Trotter Jr.:
On stable set polyhedra for K1, 3-free graphs. 313-326 - Paul D. Seymour:
Even circuits in planar graphs. 327-338 - Ahmed Ainouche, Nicos Christofides:
Strong sufficient conditions for the existence of Hamiltonian circuits in undirected graphs. 339-343 - D. L. Greenwell, D. G. Hoffman:
On a probabilistic method in graph theory. 344-347 - Fan R. K. Chung, Ronald L. Graham, James B. Shearer:
Universal caterpillars. 348-355
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-06-01 01:06 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:
