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 YEAR=1971
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
über das schwache Kartesische Produkt von Graphen
Wilfried Imrich
Journal of Combinatorial Theory Series B
11
, 1971, pp. 1-16
On extremal factors of the de Bruijn graph
Abraham Lempel
Journal of Combinatorial Theory Series B
11
, 1971, pp. 17-27
On the compatibility between a graph and a simple order
Fred S. Roberts
Journal of Combinatorial Theory Series B
11
, 1971, pp. 28-38
Sur un problème de Erdŏs et Hajnal
Michel las Vergnas
Journal of Combinatorial Theory Series B
11
, 1971, pp. 39-44
The uniqueness of a certain graph
Allan Gewirtz
,
Louis V. Quintas
Journal of Combinatorial Theory Series B
11
, 1971, pp. 45-53
On repeated interchange graphs. II
V.V. Menon
Journal of Combinatorial Theory Series B
11
, 1971, pp. 54-57
Dissections of a tetrahedron
G.L. Alexanderson
,
John E. Wetzel
Journal of Combinatorial Theory Series B
11
, 1971, pp. 58-66
On a graph of Hoffman and Singleton
C.T. Benson
,
N.E. Losey
Journal of Combinatorial Theory Series B
11
, 1971, pp. 67-79
Pancyclic graphs. I
J.A. Bondy
Journal of Combinatorial Theory Series B
11
, 1971, pp. 80-84
Ballots and plane trees
John Riordan
Journal of Combinatorial Theory Series B
11
, 1971, pp. 85-88
The genus of the cartesian product of two graphs
Arthur T. White
Journal of Combinatorial Theory Series B
11
, 1971, pp. 89-94
On the action of non-abelian groups on graphs
Mark E. Watkins
Journal of Combinatorial Theory Series B
11
, 1971, pp. 95-104
Comparison of labeled trees with valency three
D.F. Robinson
Journal of Combinatorial Theory Series B
11
, 1971, pp. 105-119
Equicardinal matroids
U.S.R. Murty
Journal of Combinatorial Theory Series B
11
, 1971, pp. 120-126
Spanning trees of dual graphs
Norman Biggs
Journal of Combinatorial Theory Series B
11
, 1971, pp. 127-131
Automorphisms of imbedded graphs
Norman Biggs
Journal of Combinatorial Theory Series B
11
, 1971, pp. 132-138
On a conjecture concerning the reconstruction of graphs
Roger M. Bryant
Journal of Combinatorial Theory Series B
11
, 1971, pp. 139-141
On the number of distinct orderings of a vertex-labeled graph when rooted on different vertices
M. Gordon
,
T.G. Parker
,
W.B. Temple
Journal of Combinatorial Theory Series B
11
, 1971, pp. 142-156
Notes on plane partitions, V
Basil Gordon
Journal of Combinatorial Theory Series B
11
, 1971, pp. 157-168
On the 1-factors on
n
-connected graphs
Joseph Zaks
Journal of Combinatorial Theory Series B
11
, 1971, pp. 169-180
A geometric representation of certain generalized hexagons in
PG(3,s)
Stanley E. Payne
Journal of Combinatorial Theory Series B
11
, 1971, pp. 181-191
The Möbius function and connected graphs
C.C. Cadogan
Journal of Combinatorial Theory Series B
11
, 1971, pp. 193-200
On the planarity of regular incidence sequences
A.B. Owens
Journal of Combinatorial Theory Series B
11
, 1971, pp. 201-212
A generalization of Moore graphs of diameter two
R.C. Bose
,
T.A. Dowling
Journal of Combinatorial Theory Series B
11
, 1971, pp. 213-226
Eine Bemerkung zu einer Arbeit von M.E. Watkins über verallgemeinerte Petersensche Graphen
Elisabeth Kaiser
,
Hansjoachim Walther
Journal of Combinatorial Theory Series B
11
, 1971, pp. 227-233
Seiten 1
2
3
>