Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Combinatorial Theory, Series B, Volume 42
Volume 42, Number 1, February 1987
- John Donald, John Elwin, Richard Hager, Peter Salamon:
Handle bases and bounds on the number of subgraphs. 1-13 - Bojan Mohar:
The enumeration of akempic triangulations. 14-23 - Geoff Whittle:
Modularity of tangential k-blocks. 24-35 - Paul D. Seymour
, Carsten Thomassen:
Characterization of even directed graphs. 36-45 - William L. Kocay:
A family of nonreconstructible hypergraphs. 46-63 - Paul M. Terwilliger:
P and Q polynomial schemes with q = -1. 64-67 - Bojan Mohar:
Simplicial schemes. 68-86 - Kiyoshi Ando, Hikoe Enomoto, Akira Saito:
Contractible edges in 3-connected graphs. 87-93 - Herbert Fleischner, Bill Jackson:
Compatible path-cycle-decompositions of plane graphs. 94-121 - Rudolf Mathon:
Lower bounds for Ramsey numbers and association schemes. 122-127 - Carsten Thomassen:
Counterexamples to Adám's conjecture on arc reversals in directed graphs. 128-130
Volume 42, Number 2, April 1987
- Reinhard Diestel:
Simplicial decompositions of graphs - Some uniqueness results. 133-145 - Jon Henry Sanders:
Circuit preserving edge maps II. 146-155 - Jean-Pierre Roudneff:
An inequality for 3-polytopes. 156-166 - Abdelhamid Benhocine, A. Pawel Wojda:
The Geng-Hua Fan conditions for pancyclic or Hamilton-connected graphs. 167-180 - Alan M. Frieze, Bill Jackson:
Large induced trees in sparse random graphs. 181-195 - Ying Cheng, James G. Oxley:
On weakly symmetric graphs of order twice a prime. 196-211 - James G. Oxley:
A characterization of the ternary matroids with no M(K4)-minor. 212-249 - David W. Barnette:
5-connected 3-polytopes are refinements of octahedra. 250-254
Volume 42, Number 3, June 1987
- Bor-Liang Chen, Ko-Wei Lih:
Hamiltonian uniform subset graphs. 257-263 - Chính T. Hoàng:
Alternating orientation and alternating colouration of perfect graphs. 264-273 - Kenneth A. Berman:
Balanced vertex weightings and arborescences. 274-301 - Chính T. Hoàng:
On a conjecture of Meyniel. 302-312 - Alan Tucker:
Coloring perfect (K4 - e)-free graphs. 313-318 - Tamás Terlaky:
A finite crisscross method for oriented matroids. 319-327 - Lin Yucai, Huang Guoxun, Li Jiongsheng:
Score vectors of Kotzig tournaments. 328-336 - Thomas Zaslavsky:
The biased graphs whose matroids are binary. 337-347 - Andrew M. Odlyzko, Herbert S. Wilf:
Bandwidths and profiles of trees. 348-370 - Yoshimi Egawa:
Cycles in k-connected graphs whose deletion results in a (k-2)-connected graph. 371-377 - Terry A. McKee:
Generalized complementation. 378-383
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-26 17:31 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:
