Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Journal=J. Comb.~Theory Series B AND Volume=42
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Handle bases and bounds on the number of subgraphs
John Donald
,
John Elwin
,
Richard Hager
,
Peter Salamon
Journal of Combinatorial Theory Series B
42
(1), 1987, February, pp. 1-13
The enumeration of akempic triangulations
Bojan Mohar
Journal of Combinatorial Theory Series B
42
(1), 1987, February, pp. 14-23
Modularity in tangential
k
-blocks
Geoff Whittle
Journal of Combinatorial Theory Series B
42
(1), 1987, February, pp. 24-35
Characterization of even directed graphs
Paul Seymour
,
Carsten Thomassen
Journal of Combinatorial Theory Series B
42
(1), 1987, February, pp. 36-45
A family of nonreconstructible hypergraphs
W.L. Kocay
Journal of Combinatorial Theory Series B
42
(1), 1987, February, pp. 46-63
P
and
Q
polynomial schemes with
q=-1
Paul Terwilliger
Journal of Combinatorial Theory Series B
42
(1), 1987, February, pp. 64-67
Simplicial schemes
Bojan Mohar
Journal of Combinatorial Theory Series B
42
(1), 1987, February, pp. 68-86
Contractible edges in 3-connected graphs
Kiyoshi Ando
,
Hikoe Enomoto
,
Akira Saito
Journal of Combinatorial Theory Series B
42
(1), 1987, February, pp. 87-93
Compatible path-cycle-decompositions of plane graphs
Herbert Fleischner
,
Bill Jackson
Journal of Combinatorial Theory Series B
42
(1), 1987, February, pp. 94-121
Lower bounds for Ramsey numbers and association schemes
Rudolf Mathon
Journal of Combinatorial Theory Series B
42
(1), 1987, February, pp. 122-127
Counterexamples to Adam's conjecture on arc reversals in directed graphs
Carsten Thomassen
Journal of Combinatorial Theory Series B
42
(1), 1987, February, pp. 128-130
Simplicial decompositions of graphs-Some uniqueness results
Reinhard Diestel
Journal of Combinatorial Theory Series B
42
(2), 1987, April, pp. 133-145
Circuit preserving edge maps. II
Jon Henry Sanders
Journal of Combinatorial Theory Series B
42
(2), 1987, April, pp. 146-155
An inequality for 3-polytopes
Jean-Pierre Roudneff
Journal of Combinatorial Theory Series B
42
(2), 1987, April, pp. 156-166
The Geng-Hua Fan conditions for pancyclic or Hamilton-connected graphs
A. Benhocine
,
A.P. Wojda
Journal of Combinatorial Theory Series B
42
(2), 1987, April, pp. 167-180
Large induced trees in sparse random graphs
A.M. Frieze
,
B. Jackson
Journal of Combinatorial Theory Series B
42
(2), 1987, April, pp. 181-195
On weakly symmetric graphs of order twice a prime
Ying Cheng
,
James Oxley
Journal of Combinatorial Theory Series B
42
(2), 1987, April, pp. 196-211
A characterization of the ternary matroids with no
M(K_4)
-minor
James G. Oxley
Journal of Combinatorial Theory Series B
42
(2), 1987, April, pp. 212-249
5-connected 3-polytopes are refinements of octahedra
D.W. Barnette
Journal of Combinatorial Theory Series B
42
(2), 1987, April, pp. 250-254
Hamiltonian uniform subset graphs
Bor-Liang Chen
,
Ko-Wei Lih
Journal of Combinatorial Theory Series B
42
(3), 1987, June, pp. 257-263
Alternating orientation and alternating colouration of perfect graphs
C.T. Hoàng
Journal of Combinatorial Theory Series B
42
(3), 1987, June, pp. 264-273
Balanced vertex weightings and arborescences
K.A. Berman
Journal of Combinatorial Theory Series B
42
(3), 1987, June, pp. 274-301
On a conjecture of Meyniel
C.T. Hoàng
Journal of Combinatorial Theory Series B
42
(3), 1987, June, pp. 302-312
Coloring perfect
(K_4-e)
-free graphs
Alan Tucker
Journal of Combinatorial Theory Series B
42
(3), 1987, June, pp. 313-318
A finite crisscross method for oriented matroids
Tamás Terlaky
Journal of Combinatorial Theory Series B
42
(3), 1987, June, pp. 319-327
Seiten 1
2
>