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=13
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Décomposition de
K_{16}
en trois graphes planaires
J. Mayer
Journal of Combinatorial Theory Series B
13
, 1972, pp. 71
Establishing the matching polytope
M.L. Balinski
Journal of Combinatorial Theory Series B
13
, 1972, pp. 1-13
Coefficients of chromatic polynomials
G.H.J. Meredith
Journal of Combinatorial Theory Series B
13
, 1972, pp. 14-17
Counting patterns in graphs
Guido Guardabassi
Journal of Combinatorial Theory Series B
13
, 1972, pp. 18-25
Smooth solutions in case 1 of the Heawood conjecture for non-orientable surfaces
E.M. Landesman
,
J.W.T. Youngs
Journal of Combinatorial Theory Series B
13
, 1972, pp. 26-39
A proof of Golomb's conjecture for the de Bruijn graph
Johannes Mykkeltveit
Journal of Combinatorial Theory Series B
13
, 1972, pp. 40-45
Chromatic reduction of the triangulations
T_6
,
e = e_5 + e_7
H. Heesch
Journal of Combinatorial Theory Series B
13
, 1972, pp. 46-55
Inequalities and asymptotic bounds for Ramsey numbers
James Yackel
Journal of Combinatorial Theory Series B
13
, 1972, pp. 56-68
Monochromatic paths in edge-colored graphs
V. Chvátal
Journal of Combinatorial Theory Series B
13
, 1972, pp. 69-70
Five-coloring planar maps
Walter Meyer
Journal of Combinatorial Theory Series B
13
, 1972, pp. 72-82
Enumeration of almost cubic maps
A.M. Mathai
,
P.N. Rathie
Journal of Combinatorial Theory Series B
13
, 1972, pp. 83-90
A characterization of perfect graphs
L. Lovász
Journal of Combinatorial Theory Series B
13
, 1972, pp. 95-98
Isographs and oriented isographs
M.R. Sridharan
,
K.R. Parthasarathy
Journal of Combinatorial Theory Series B
13
, 1972, pp. 99-111
On the number of unique subgraphs of a graph
R.C. Entringer
,
Paul Erdŏs
Journal of Combinatorial Theory Series B
13
, 1972, pp. 112-115
A two-connected planar graph without concurrent longest paths
Tudor Zamfirescu
Journal of Combinatorial Theory Series B
13
, 1972, pp. 116-121
Counting rooted maps by genus.II
T. Walsh
,
A.B. Lehman
Journal of Combinatorial Theory Series B
13
, 1972, pp. 122-141
Characterizations of certain classes of graphs
Ernest E. Shult
Journal of Combinatorial Theory Series B
13
, 1972, pp. 142-167
Some lower bounds of the Ramsey numbers
n(k,k)
James P. Burling
,
Steven W. Reyner
Journal of Combinatorial Theory Series B
13
, 1972, pp. 168-169
On hearing the shape of combinatorial drums
C.T. Benson
,
John B. Jacobs
Journal of Combinatorial Theory Series B
13
, 1972, pp. 170-178
Remark on a paper of Piff and Welsh
A.O. Atkin
Journal of Combinatorial Theory Series B
13
, 1972, pp. 179-182
A simple proof of the Erdŏs-Chao Ko-Rado theorem
G.O.H. Katona
Journal of Combinatorial Theory Series B
13
, 1972, pp. 183-184
On factorable degree sequences
A. Ramachandra Rao
,
S.B. Rao
Journal of Combinatorial Theory Series B
13
, 1972, pp. 185-191
Counting rooted maps by genus.I
T.R.S. Walsh
,
A.B. Lehman
Journal of Combinatorial Theory Series B
13
, 1972, pp. 192-218
Arc colorings of digraphs
C.C. Harner
,
R.C. Entringer
Journal of Combinatorial Theory Series B
13
, 1972, pp. 219-225
Note on isomorphic hypergraphs and some extensions of Whitney's theorem to families of sets
C. Berge
,
R. Rado
Journal of Combinatorial Theory Series B
13
, 1972, pp. 226-241
Seiten 1
2
>