Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Combinatorial Theory, Series B, Volume 41
Volume 41, Number 1, August 1986
- Maria Angela C. M. Gurgel, Yoshiko Wakabayashi
:
On k-leaf-connected graphs. 1-16 - Bill Jackson:
Longest cycles in 3-connected cubic graphs. 17-26 - Mikio Kano:
Factors of regular graphs. 27-36 - Thomas Andreae:
On a pursuit game played on graphs for which a minor is excluded. 37-47 - Peter C. Fishburn:
Proportional transitivity in linear extensions of ordered sets. 48-60 - Paul Erdös, Michael E. Saks, Vera T. Sós:
Maximum induced trees in graphs. 61-79 - Béla Bollobás, Brendan D. McKay:
The number of matchings in random regular graphs and bipartite graphs. 80-91 - Neil Robertson, Paul D. Seymour:
Graph minors. V. Excluding a planar graph. 92-114 - Neil Robertson, Paul D. Seymour:
Graph minors. VI. Disjoint paths across a disc. 115-138
Volume 41, Number 2, October 1986
- Clyde L. Monma, Victor K.-W. Wei:
Intersection graphs of paths in a tree. 141-181 - Hans-Jürgen Bandelt, Henry Martyn Mulder:
Distance-hereditary graphs. 182-208 - Ioan Tomescu:
Hypertrees and Bonferroni inequalities. 209-217 - Raffaele Scapellato:
Geodetic graphs of diameter two and some related structures. 218-229 - H. D. Macpherson:
Graphs determined by their finite induced subgraphs. 230-234 - R. Taylor:
Similarity reconstruction of trees. 235-245 - Michel Las Vergnas:
Order properties of lines in the plane and a conjecture of G. Ringel. 246-249 - James G. Oxley:
On the matroids representable over GF(4). 250-252
Volume 41, Number 3, December 1986
- Alexandre A. Ivanov:
Distance-transitive representations of the symmetric groups. 255-274 - Klaus Truemper:
A decomposition theory for matroids III. Decomposition conditions. 275-305 - Odile Marcotte:
On the chromatic index of multigraphs and a conjecture of Seymour (I). 306-331 - Michael Tarsi:
Semi-duality and the cycle double cover conjecture. 332-340 - Mark E. Watkins:
Infinite paths that contain only shortest paths. 341-355 - Hans Jürgen Prömel:
Partition properties of q-hypergraphs. 356-385
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-05-10 18:47 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:
