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=48
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Distribution of contractible edges in
k
-connected graphs
Nathaniel Dean
Journal of Combinatorial Theory Series B
48
, 1990, pp. 1-5
On graph invariants given by linear recurrence relations
David N. Yetter
Journal of Combinatorial Theory Series B
48
, 1990, pp. 6-18
Asymptotic enumeration of Latin rectangles
C.D. Godsil
,
B.D. McKay
Journal of Combinatorial Theory Series B
48
, 1990, pp. 19-44
The chromatic index of graphs with large maximum degree, where the number of vertices of maximum degree is relatively small
A.G. Chetwynd
,
A.J.W. Hilton
Journal of Combinatorial Theory Series B
48
, 1990, pp. 45-66
A Menger-like property of tree-width: The finite case
Robin Thomas
Journal of Combinatorial Theory Series B
48
, 1990, pp. 67-76
Edge-disjoint homotopic paths in a planar graph with one hole
C. van Hoesel
,
A. Schrijver
Journal of Combinatorial Theory Series B
48
, 1990, pp. 77-91
On the complexity of
H
-coloring
Pavol Hell
,
Jaroslav Nes̑etȓil
Journal of Combinatorial Theory Series B
48
, 1990, pp. 92-110
Hamiltonian degree conditions which imply a graph is pancyclic
Douglas Bauer
,
Edward Schmeichel
Journal of Combinatorial Theory Series B
48
, 1990, pp. 111-116
The limiting probability that
\alpha
-in,
\beta
-out is strongly connected
C. Cooper
,
A.M. Frieze
Journal of Combinatorial Theory Series B
48
, 1990, pp. 117-134
On the
P_4
-structure of perfect graphs. IV. Partner graphs
Ryan B. Hayward
,
William J. Lenhart
Journal of Combinatorial Theory Series B
48
, 1990, pp. 135-139
Average distances in undirected graphs and the removal of vertices
Ingo Althöfer
Journal of Combinatorial Theory Series B
48
, 1990, pp. 140-142
Map coloring and the vector cross product
Louis H. Kaufman
Journal of Combinatorial Theory Series B
48
, 1990, pp. 145-154
Embeddings of graphs with no short noncontractible cycles
Carsten Thomassen
Journal of Combinatorial Theory Series B
48
, 1990, pp. 155-177
A characterization of Grassmann and Johnson graphs
Minoru Numata
Journal of Combinatorial Theory Series B
48
, 1990, pp. 178-190
Directed distance regular graphs with the
Q
-polynomial property
Douglas A. Leonard
Journal of Combinatorial Theory Series B
48
, 1990, pp. 191-196
Simplicial tree-decompositions of infinite graphs, I
Reinhard Diestel
Journal of Combinatorial Theory Series B
48
, 1990, pp. 197-215
k
-linked and
k
-cyclic digraphs
Yannis Manoussakis
Journal of Combinatorial Theory Series B
48
, 1990, pp. 216-226
Graphs minors. IV. Tree-width and well-quasi-ordering
Neil Robertson
,
P.D. Seymour
Journal of Combinatorial Theory Series B
48
, 1990, pp. 227-254
Graph minors. VIII. A Kuratowski theorem for general surfaces
Neil Robertson
,
P.D. Seymour
Journal of Combinatorial Theory Series B
48
, 1990, pp. 255-288
A generalization of an inequality of Stepanov
Lajos Takács
Journal of Combinatorial Theory Series B
48
, 1990, pp. 289-293