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=14
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Almost every graph has reconstruction number three
Béla Bollobás
Journal of Graph Theory
14
(1), 1990, pp. 1-4
Repeated edges in 2-factorizations
Charles J. Colbourn
,
Alexander Rosa
Journal of Graph Theory
14
(1), 1990, pp. 5-24
New upper bounds for the greatest number of proper colorings of a
(V,E)
-graph
Felix Lazebnik
Journal of Graph Theory
14
(1), 1990, pp. 25-29
Hamiltonian cycles in planar triangulations with no separating triangles
Michael B. Dillencourt
Journal of Graph Theory
14
(1), 1990, pp. 31-49
On the maxiimum number of pairwise compatible Euler cycles
H. Fleischner
,
A.J.W. Hilton
,
Bill Jackson
Journal of Graph Theory
14
(1), 1990, pp. 51-63
Regular graphs with prescribed chromatic number
L. Caccetta
,
N.J. Pullman
Journal of Graph Theory
14
(1), 1990, pp. 65-71
On the linear vertex-arboricity of a planar graph
K.S. Poh
Journal of Graph Theory
14
(1), 1990, pp. 73-75
Reduced graphs of diameter two
Hong-Jian Lai
Journal of Graph Theory
14
(1), 1990, pp. 77-87
The chromaticity of complete bipartite graphs with at most one edge deleted
C.P. Teo
,
K.M. Koh
Journal of Graph Theory
14
(1), 1990, pp. 89-99
Maximal chromatic polynomials of connected planar graphs
Ioan Tomescu
Journal of Graph Theory
14
(1), 1990, pp. 101-110
Circuits in Cayley digraphs of finite Abelian groups
Anne Marie Wilkinson
Journal of Graph Theory
14
(1), 1990, pp. 111-116
Bounds for the vertex linear arboricity
Makoto Matsumoto
Journal of Graph Theory
14
(1), 1990, pp. 117-126
Cycles containing matchings and pairwise compatible Euler tours
Bill Jackson
,
Nicholas C. Wormald
Journal of Graph Theory
14
(1), 1990, pp. 127-138
Regular graphs having the same path layer matrix
A.A. Dobrynin
Journal of Graph Theory
14
(2), 1990, pp. 141-148
The ally-reconstruction number of a tree with five or more vertices is three
Wendy Myrvold
Journal of Graph Theory
14
(2), 1990, pp. 149-166
Maximal matchings in graphs with large neighborhoods of independent vertices
I. Rinsma
,
C.H.C. Little
,
D.R. Woodall
Journal of Graph Theory
14
(2), 1990, pp. 167-171
The edge reconstruction of Hamiltonian graphs
L. Pyber
Journal of Graph Theory
14
(2), 1990, pp. 173-179
A note on bipartite subgraphs of triangle-free regular graphs
S.C. Locke
Journal of Graph Theory
14
(2), 1990, pp. 181-185
The size of strength-maximal graphs
Hong-Jian Lai
Journal of Graph Theory
14
(2), 1990, pp. 187-197
On the parity of planar covers
Dan Archdeacon
,
R. Bruce Richter
Journal of Graph Theory
14
(2), 1990, pp. 199-204
Hamiltonian properties of domination-critical graphs
Ewa Wojcicka
Journal of Graph Theory
14
(2), 1990, pp. 205-215
The phase transition in the evolution of random digraphs
Tomasz Łuczak
Journal of Graph Theory
14
(2), 1990, pp. 217-223
Class 1 conditions depending on the minimum degree and the number of vertices of maximum degree
Thomas Niessen
,
Lutz Volkmann
Journal of Graph Theory
14
(2), 1990, pp. 225-246
Graphs with homeomorphically irreducible spanning trees
Michael O. Albertson
,
David M. Berman
,
Joan P. Hutchinson
,
Carsten Thomassen
Journal of Graph Theory
14
(2), 1990, pp. 247-258
Perfect path double covers of graphs
J.A. Bondy
Journal of Graph Theory
14
(2), 1990, pp. 259-272
Seiten 1
2
3
>