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=37
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A minimax theorem on intervals
Ervin Györi
Journal of Combinatorial Theory Series B
37
, 1984, pp. 1-9
Pancyclic properties of the graph of some 0-1 polyhedra
Denis Naddef
Journal of Combinatorial Theory Series B
37
, 1984, pp. 10-26
On Schmerl's effective version of Brooks' theorem
Helge Tverberg
Journal of Combinatorial Theory Series B
37
, 1984, pp. 27-30
Injection geometries
M. Deza
,
P. Frankl
Journal of Combinatorial Theory Series B
37
, 1984, pp. 31-40
Hamiltonicity in (0-1)-polyhedra
D.J. Naddef
,
W.R. Pulleyblank
Journal of Combinatorial Theory Series B
37
, 1984, pp. 41-52
Maximum graphs with a unique
k
-factor
G.R.T. Hendry
Journal of Combinatorial Theory Series B
37
, 1984, pp. 53-63
Extremal non-bipartite regular graphs of girth 4
Douglas Bauer
Journal of Combinatorial Theory Series B
37
, 1984, pp. 64-69
Monotonicity of the mean order of subtrees
Robert E. Jamison
Journal of Combinatorial Theory Series B
37
, 1984, pp. 70-78
Regular subgraphs of almost regular graphs
N. Alon
,
S. Friedland
,
G. Kalai
Journal of Combinatorial Theory Series B
37
, 1984, pp. 79-91
Every 4-regular graph plus an edge contains a 3-regular subgraph
N. Alon
,
S. Friedland
,
G. Kalai
Journal of Combinatorial Theory Series B
37
, 1984, pp. 92-93
On the critical exponent of transversal matroids
Geoffrey P. Whittle
Journal of Combinatorial Theory Series B
37
, 1984, pp. 94-95
Distance degree regular graphs
Teluhiko Hilano
,
Kazumasa Nomura
Journal of Combinatorial Theory Series B
37
, 1984, pp. 96-100
Hamiltonian cycles in random regular graphs
T.I. Fenner
,
A.M. Frieze
Journal of Combinatorial Theory Series B
37
, 1984, pp. 103-112
On the length of optimal TSP circuits in sets of bounded diameter
Shlomo Moran
Journal of Combinatorial Theory Series B
37
, 1984, pp. 113-141
Generalized Petersen graphs which are cycle permutation graphs
S. Stueckle
,
R.D. Ringeisen
Journal of Combinatorial Theory Series B
37
, 1984, pp. 142-150
Paths and edge-connectivity in graphs
Haruko Okamura
Journal of Combinatorial Theory Series B
37
, 1984, pp. 151-172
The graphs
G(n,k)
of the Johnson schemes are unique for
n \geq 20
Aeryung Moon
Journal of Combinatorial Theory Series B
37
, 1984, pp. 173-188
On singleton 1-rounded sets of matroids
James G. Oxley
Journal of Combinatorial Theory Series B
37
, 1984, pp. 189-197
A generalization of Tutte's 1-factor theorem to countable graphs
Ron Aharoni
Journal of Combinatorial Theory Series B
37
, 1984, pp. 199-209
Characterization of quadratic and cubic
\sigma
-polynomials
Medha Dhurandhar
Journal of Combinatorial Theory Series B
37
, 1984, pp. 210-220
New sufficient conditions for cycles in graphs
Geng-Hua Fan
Journal of Combinatorial Theory Series B
37
, 1984, pp. 221-227
Bounds on graph spectra
R.C. Brigham
,
R.D. Dutton
Journal of Combinatorial Theory Series B
37
, 1984, pp. 228-234
Symmetric graphs and interpretations
Emo Welzl
Journal of Combinatorial Theory Series B
37
, 1984, pp. 235-244
A refinement of Kuratowski's theorem
Carsten Thomassen
Journal of Combinatorial Theory Series B
37
, 1984, pp. 245-253
Independence in graphs with maximum degree four
Kathryn Fraughnaugh Jones
Journal of Combinatorial Theory Series B
37
, 1984, pp. 254-269
Seiten 1
2
>