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: Author="Harary, Frank"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the computational complexity of the forcing chromatic number
Frank Harary
,
Wolfgang Slany
,
Oleg Verbitsky
SIAM Journal on Computing
37
(1), 2007, pp. 1-19
On the computational complexity of the forcing chromatic number
Frank Harary
,
Wolfgang Slany
,
Oleg Verbitsky
Lecture Notes in Computer Science
3404
, 2005, pp. 182-193
On the geodetic number of a graph
Gary Chartrand
,
Frank Harary
,
Ping Zhang
Networks
39
(1), 2002, pp. 1-6
On the maximum number of cyclic triples in oriented graphs
Lowell W. Beineke
,
Frank Harary
Journal of Combinatorial Theory Series B
81
(2), 2001, pp. 165-176
A new graph characteristic and its application to numerical computability
Frank Harary
,
Vladik Kreinovich
,
Luc Longpré
Information Processing Letters
77
(5-6), 2001, pp. 277-282
Breaking symmetry in complete graphs by orienting edges: Asymptotic bounds
Frank Harary
,
Desh Ranjan
Information Processing Letters
67
(5), 1998, pp. 227-230
Node fault tolerance in graphs
Frank Harary
,
John P. Hayes
Networks
27
(1), 1996, pp. 19-23
A study of maximum unit-circle caterpillars - Tools for the study of the shape of adsorption patterns
Frank Harary
,
William Randolph
,
Paul G. Mezey
Discrete Applied Mathematics
67
(1-3), 1996, pp. 127-135
Subcube fault-tolerance in hypercubes
Niall Graham
,
Frank Harary
,
Marilynn Livingston
,
Quentin F. Stout
Information and Computation
102
(2), 1993, February, pp. 280-314
Edge fault tolerance in graphs
Frank Harary
,
John P. Hayes
Networks
23
(2), 1993, pp. 135-142
Changing and unchanging the diameter of a hypercube
Niall Graham
,
Frank Harary
Discrete Applied Mathematics
37/38
, 1992, pp. 265-274
Research problems - What is the difference between the domination and independent domination numbers of a cubic graph?
Curtiss Barefoot
,
Frank Harary
,
Kathryn F. Jones
Graphs and Combinatorics
7
, 1991, pp. 205-208
Classification of interpolation theorems for spanning trees and other families of spanning subgraphs
Frank Harary
,
Michael J. Plantholt
Journal of Graph Theory
13
(6), 1989, pp. 703-712
On the Euclidean dimension of a wheel
Fred Buckley
,
Frank Harary
Graphs and Combinatorics
4
, 1988, pp. 23-30
Embedding and characterization of quantum chemical reaction graphs on two-dimensional orientable surfaces
Frank Harary
,
Paul G. Mezey
Discrete Applied Mathematics
19
, 1988, pp. 205-214
The class reconstruction number of maximal planar graphs
Frank Harary
,
Josef Lauri
Graphs and Combinatorics
3
, 1987, pp. 45-53
Hamiltonian threshold graphs
Frank Harary
,
Uri Peled
Discrete Applied Mathematics
16
, 1987, pp. 11-15
On the regulation number of a multigraph
Gary Chartrand
,
Frank Harary
,
Ortrud R. Oellermann
Graphs and Combinatorics
1
, 1985, pp. 137-144
On signed digraphs with all cycles negative
Frank Harary
,
J. Richard Lundgren
,
John S. Maybee
Discrete Applied Mathematics
12
, 1985, pp. 155-164
The graph reconstruction number
Frank Harary
,
Michael Plantholt
Journal of Graph Theory
9
(4), 1985, pp. 451-454
Isomorphic factorizations X: Unsolved problems
Frank Harary
,
Robert W. Robinson
Journal of Graph Theory
9
(1), 1985, pp. 67-86
The rediscovery of Redfield's papers
Frank Harary
,
Robert W. Robinson
Journal of Graph Theory
8
(2), 1984, pp. 191-193
Isomorphic factorizations VIII: Bisectable trees
Frank Harary
,
Robert W. Robinson
Combinatorica
4
, 1984, pp. 169-179
Regular graphs with given girth pair
Frank Harary
,
Peter Kovács
Journal of Graph Theory
7
(2), 1983, pp. 209-218
A tribute to Frank P. Ramsey, 1903-1930
Frank Harary
Journal of Graph Theory
7
(1), 1983, pp. 1-7
Seiten 1
2
3
>