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. Graph Theory AND YEAR=1981
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Cycles in digraphs - A survey
J.C. Bermond
,
C. Thomassen
Journal of Graph Theory
5
(1), 1981, pp. 1-43
The chromatic index of graphs with a spanning star
Mike Plantholt
Journal of Graph Theory
5
(1), 1981, pp. 45-53
A duality theorem for graph embeddings
Brad Jackson
,
T.D. Parsons
,
Tomaz̑ Pisanski
Journal of Graph Theory
5
(1), 1981, pp. 55-77
The smallest graph of girth 6 and valency 7
M. O'Keefe
,
P.K. Wong
Journal of Graph Theory
5
(1), 1981, pp. 79-85
On a graph of O'Keefe and Wong
T. Ito
Journal of Graph Theory
5
(1), 1981, pp. 87-94
The genus of the 2-amalgamations of graphs
R.W. Decker
,
H.H. Glover
,
J.P. Huneke
Journal of Graph Theory
5
(1), 1981, pp. 95-102
A graph and its complement with specified properties - IV. Counting self-complementary blocks
Jin Akiyama
,
Frank Harary
Journal of Graph Theory
5
(1), 1981, pp. 103-107
A note on constructive methods for Ramsey numbers
F.R.K. Chung
Journal of Graph Theory
5
(1), 1981, pp. 109-113
Enumeration of nonisomorphic planar maps
V.A. Liskovets
Journal of Graph Theory
5
(1), 1981, pp. 115-117
On the reconstruction of locally finite trees
Thomas Andreae
Journal of Graph Theory
5
(2), 1981, pp. 123-135
On the theory of the matching polynomial
C.D. Godsil
,
I. Gutman
Journal of Graph Theory
5
(2), 1981, pp. 137-144
Long paths and cycles in oriented graphs
Bill Jackson
Journal of Graph Theory
5
(2), 1981, pp. 145-157
A construction of chromatic index critical graphs
Hian Poh Yap
Journal of Graph Theory
5
(2), 1981, pp. 159-163
An upper bound on the size of the largest cliques in a graph
Alain Billionnet
Journal of Graph Theory
5
(2), 1981, pp. 165-169
Pseudosimilar vertices in a graph
Robert J., Jr. Kimble
,
Allen J. Schwenk
,
Paul K. Stockmeyer
Journal of Graph Theory
5
(2), 1981, pp. 171-181
Counting the 10-point graphs by partition
R.C. Read
,
N.C. Wormald
Journal of Graph Theory
5
(2), 1981, pp. 183-196
Hamiltonian groups are color-graph-Hamiltonian
Joseph B. Klerlein
,
A. Gregory Starling
Journal of Graph Theory
5
(2), 1981, pp. 197-199
A graph which is edge transitive but not arc transitive
D.F. Holt
Journal of Graph Theory
5
(2), 1981, pp. 201-204
Every connected, locally connected graph is upper embeddable
Ladislav Nebeský
Journal of Graph Theory
5
(2), 1981, pp. 205-207
A note on path and cycle decompositions of graphs
Dom de Caen
Journal of Graph Theory
5
(2), 1981, pp. 209-211
On strongly regular self-complementary graphs
Sergio Ruiz
Journal of Graph Theory
5
(2), 1981, pp. 213-215
Homage to the memory of Kazimierz Kuratowski
Frank Harary
Journal of Graph Theory
5
(3), 1981, pp. 217-219
A note on the work and life of Kazimierz Kuratowski
J. Krasinkiewicz
Journal of Graph Theory
5
(3), 1981, pp. 221-223
Kuratowski's theorem
Carsten Thomassen
Journal of Graph Theory
5
(3), 1981, pp. 225-241
A Kuratowski theorem for the projective plane
Dan Archdeacon
Journal of Graph Theory
5
(3), 1981, pp. 243-246
Seiten 1
2
3
>