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 Volume=3
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Survey of results on the maximum genus of a graph
Richard D. Ringeisen
Journal of Graph Theory
3
(1), 1979, pp. 1-13
Minimally 2-edge connected graphs
G. Chaty
,
M. Chein
Journal of Graph Theory
3
(1), 1979, pp. 15-22
1-factorizations of Cartesian products of regular graphs
Anton Kotzig
Journal of Graph Theory
3
(1), 1979, pp. 23-34
An intermediate value theorem for graphs with given automorphism group
Pavol Hell
,
Louis V. Quintas
Journal of Graph Theory
3
(1), 1979, pp. 35-41
Cochromatic number and the genus of a graph
H. Joseph Straight
Journal of Graph Theory
3
(1), 1979, pp. 43-51
Voltage graph embeddings and the associated block designs
Brian L. Garman
Journal of Graph Theory
3
(1), 1979, pp. 53-67
On the number of cycles of length
k
in a maximal planar graph
S.L. Hakimi
,
E.F. Schmeichel
Journal of Graph Theory
3
(1), 1979, pp. 69-86
On line graphs with crossing number 1
V.R. Kulli
,
D.G. Akka
,
L.W. Beineke
Journal of Graph Theory
3
(1), 1979, pp. 87-90
A note on sub-Eulerian graphs
F. Jaeger
Journal of Graph Theory
3
(1), 1979, pp. 91-93
Further annotated bibliography on the isomorphism disease
Georg Gati
Journal of Graph Theory
3
(2), 1979, pp. 95-109
On the construction of the self-complementary graphs on 12 nodes
Marg Kropar
,
Ronald C. Read
Journal of Graph Theory
3
(2), 1979, pp. 111-125
Forests of label-increasing trees
John Riordan
Journal of Graph Theory
3
(2), 1979, pp. 127-133
Group labelings of graphs
Paul H. Edelman
,
Michael Saks
Journal of Graph Theory
3
(2), 1979, pp. 135-140
Spanning arborescences, ingraphs, and outgraphs
Kenneth A. Berman
Journal of Graph Theory
3
(2), 1979, pp. 141-150
Graph theoretic characterization of the matrix property of full irreducibility without using a transversal
Aram K. Kevorkian
Journal of Graph Theory
3
(2), 1979, pp. 151-174
On the use of alternating chains and hypergraphs in edge coloring
D. de Werra
Journal of Graph Theory
3
(2), 1979, pp. 175-182
Randomly matchable graphs
David P. Sumner
Journal of Graph Theory
3
(2), 1979, pp. 183-186
Orderly algorithms for generating restricted classes of graphs
Charles J. Colbourn
,
Ronald C. Read
Journal of Graph Theory
3
(2), 1979, pp. 187-195
On some subclasses of well-covered graphs
Jo Ann W. Staples
Journal of Graph Theory
3
(2), 1979, pp. 197-204
On double and multiple interval graphs
William T., Jr. Trotter
,
Frank Harary
Journal of Graph Theory
3
(3), 1979, pp. 205-211
On minimal strong blocks
Martin Grötschel
Journal of Graph Theory
3
(3), 1979, pp. 213-219
The graphs for which all strong orientations are Hamiltonian
Martin Grötschel
,
Frank Harary
Journal of Graph Theory
3
(3), 1979, pp. 221-223
Properties of almost all graphs and complexes
Andreas Blass
,
Frank Harary
Journal of Graph Theory
3
(3), 1979, pp. 225-240
Graph-theoretic parameters concerning domination, independence, and irredundance
B. Bollobás
,
E.J. Cockayne
Journal of Graph Theory
3
(3), 1979, pp. 241-249
A sufficient condition for equality of edge-connectivity and minimum degree of a graph
Donald L. Goldsmith
,
Roger C. Entringer
Journal of Graph Theory
3
(3), 1979, pp. 251-255
Seiten 1
2
>