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=15
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the decomposition of
K_n
into complete
m
-partite graphs
Qingxue Huang
Journal of Graph Theory
15
(1), 1991, pp. 1-6
On the largest tree of given maximum degree in a connected graph
Y. Caro
,
I. Krasikov
,
Y. Roditty
Journal of Graph Theory
15
(1), 1991, pp. 7-13
An upper bound on the Ramsey number
R(K_3,G)
depending only on the size of the graph
G
A.F. Sidorenko
Journal of Graph Theory
15
(1), 1991, pp. 15-17
On the cycle-isomorphism of graphs
Xingxing Yu
Journal of Graph Theory
15
(1), 1991, pp. 19-27
Long dominating cycles and paths in graphs with large neighborhood unions
H.J. Broersma
,
H.J. Veldman
Journal of Graph Theory
15
(1), 1991, pp. 29-38
On the residue of a graph
O. Favaron
,
M. Mahéo
,
J.-F. Saclé
Journal of Graph Theory
15
(1), 1991, pp. 39-64
On the homogeneous representation of interval graphs
Stephan Olariu
Journal of Graph Theory
15
(1), 1991, pp. 65-80
Bounds for the crossing number of the
N
-cube
Tom Madej
Journal of Graph Theory
15
(1), 1991, pp. 81-97
Improved lower bounds on
k
-independence
Yair Caro
,
Zsolt Tuza
Journal of Graph Theory
15
(1), 1991, pp. 99-107
A characterization of domination perfect graphs
I.E. Zverovich
,
V.E. Zverovich
Journal of Graph Theory
15
(2), 1991, pp. 109-114
On a conjecture of Wang and Williams
N.V.R. Mahadev
,
Uri N. Peled
Journal of Graph Theory
15
(2), 1991, pp. 115-120
Updating the Hamiltonian problem - A survey
Ronald J. Gould
Journal of Graph Theory
15
(2), 1991, pp. 121-157
Local extrema in genus-stratified graphs
Jonathan L. Gross
,
Robert G. Rieper
Journal of Graph Theory
15
(2), 1991, pp. 159-171
Quasi-random tournaments
F.R.K. Chung
,
R.L. Graham
Journal of Graph Theory
15
(2), 1991, pp. 173-198
Bounding the number of embeddings of 5-connected projective-planar graphs
Shigeru Kitakubo
Journal of Graph Theory
15
(2), 1991, pp. 199-205
The structure and maximum number of maximum independent sets in trees
Jennifer Zito
Journal of Graph Theory
15
(2), 1991, pp. 207-221
Seven criteria for integer sequences being graphic
Gerhard Sierksma
,
Han Hoogeveen
Journal of Graph Theory
15
(2), 1991, pp. 223-231
The threshold weight of a graph
Chi Wang
,
A.C. Williams
Journal of Graph Theory
15
(3), 1991, pp. 235-249
Score sequences of oriented graphs
Peter Avery
Journal of Graph Theory
15
(3), 1991, pp. 251-257
Regular factors in
K_1,3
-free graphs
S.A. Choudum
,
M.S. Paulraj
Journal of Graph Theory
15
(3), 1991, pp. 259-265
On path lengths modulo three
Xiaotie Deng
,
Christos H. Papadimitriou
Journal of Graph Theory
15
(3), 1991, pp. 267-282
[a,b]
-factorizations of graphs
Mao-Cheng Cai
Journal of Graph Theory
15
(3), 1991, pp. 283-301
How to deal with unlabeled random graphs
Tomasz Łuczak
Journal of Graph Theory
15
(3), 1991, pp. 303-316
Tutte polynomials for trees
Sharad Chaudhary
,
Gary Gordon
Journal of Graph Theory
15
(3), 1991, pp. 317-331
A short proof for a generalization of Vizing's theorem
Claude Berge
,
Jean Claude Fournier
Journal of Graph Theory
15
(3), 1991, pp. 333-336
Seiten 1
2
>