Frank Harary

Frank Harary, Wolfgang Slany, Oleg Verbitsky: On the Computational Complexity of the Forcing Chromatic Number. SIAM J. Comput. 37(1): 1-19 (2007)

David Erwin, Frank Harary: Destroying automorphisms by fixing nodes. Discrete Mathematics 306(24): 3244-3252 (2006)

Frank Harary, Desh Ranjan: Identity orientation of complete bipartite graphs. Discrete Mathematics 290(2/3): 173-182 (2005)

Frank Harary, Wolfgang Slany, Oleg Verbitsky: On the Computational Complexity of the Forcing Chromatic Number. STACS 2005: 182-193

Frank Harary, Meng-Hiot Lim, Amit Agarwal, Donald C. Wunsch: Algorithms for derivation of structurally stable Hamiltonian signed graphs. Int. J. Comput. Math. 81(11): 1349-1356 (2004)

Frank Harary, Wolfgang Slany, Oleg Verbitsky: On the lengths of symmetry breaking-preserving games on graphs. Theor. Comput. Sci. 303(3): 427-446 (2004)

Frank Harary, Wolfgang Slany, Oleg Verbitsky: On Computational Complexity of the Forcing Chromatic Number. CoRR cs.CC/0406044 (2004)

Frank Harary: Preface. Discrete Mathematics 272(1): 1-2 (2003)

Daniela Ferrero, Frank Harary: Edge Sums of Debruijn Interconnection Networks. Int. J. Comput. Math. 80(7): 819-824 (2003)

Frank Harary, Gopal Gupta: A constraint logic programming approach for generating all perfect matchings. Appl. Math. Lett. 15(8): 969-973 (2002)

Fred Buckley, Frank Harary: Unsolved Problems on Distance in Graphs. Electronic Notes in Discrete Mathematics 11: 89-97 (2002)

Ophir Frieder, Frank Harary, Peng-Jun Wan: A Radio Coloring of a Hypercube. Int. J. Comput. Math. 79(6): 665-670 (2002)

Gary Chartrand, Frank Harary, Ping Zhang: On the geodetic number of a graph. Networks 39(1): 1-6 (2002)

Frank Harary, Michael S. Jacobson: Destroying symmetry by orienting edges: Complete graphs and complete bigraphs. Discussiones Mathematicae Graph Theory 21(2): 149-158 (2001)

Frank Harary, Vladik Kreinovich, Luc Longpré: A new graph characteristic and its application to numerical computability. Inf. Process. Lett. 77(5-6): 277-282 (2001)

Lowell W. Beineke, Frank Harary: On the Maximum Number of Cyclic Triples in Oriented Graphs. J. Comb. Theory, Ser. B 81(2): 165-176 (2001)

Frank Harary, Wolfgang Slany, Oleg Verbitsky: A Symmetric Strategy in Graph Avoidance Games. CoRR cs.DM/0110049 (2001)

Frank Harary, Teresa W. Haynes: Double Domination in Graphs. Ars Comb. 55 (2000)

Gary Chartrand, Frank Harary, Ping Zhang: On the Hall Number of a Graph. Ars Comb. 57 (2000)

Gary Chartrand, Frank Harary, Ping Zhang: Geodetic sets in graphs. Discussiones Mathematicae Graph Theory 20(1): 129-138 (2000)

Maria Satratzemi, Constantine Tsouros, Frank Harary: An Heuristic Algorithm for Handling Multiple Responses. J. Heuristics 6(2): 269-282 (2000)

Frank Harary: The Automorphism Group of a Hypercube. J. UCS 6(1): 136-138 (2000)

Gary Chartrand, Frank Harary, Bill Quan Yue: On the out-domination and in-domination numbers of a digraph. Discrete Mathematics 197-198: 179-183 (1999)

Frank Harary, Desh Ranjan: Breaking Symmetry in Complete Graphs by Orienting Edges: Asymptotic Bounds. Inf. Process. Lett. 67(5): 227-230 (1998)

Mario Gionfriddo, Frank Harary, Zsolt Tuza: The color cost of a caterpillar. Discrete Mathematics 174(1-3): 125-130 (1997)

Frank Harary, William Randolph, Paul G. Mezey: A Study of Maximum Unit-circle Caterpillars - Tools for the Study of the Shape of Adsorption Patterns. Discrete Applied Mathematics 67(1-3): 127-135 (1996)

Frank Harary, Teresa W. Haynes: Nordhaus-Gaddum inequalities for domination in graphs. Discrete Mathematics 155(1-3): 99-105 (1996)

Frank Harary, John P. Hayes: Node fault tolerance in graphs. Networks 27(1): 19-23 (1996)

Curtiss Barefoot, Karen Casey, David C. Fisher, Kathryn Fraughnaugh, Frank Harary: Size in maximal triangle-free graphs and minimal graphs of diameter 2. Discrete Mathematics 138(1-3): 93-99 (1995)

Frank Harary: Sum graphs over all the integers. Discrete Mathematics 124(1-3): 99-105 (1994)

Daniel M. Gordon, Robert W. Robinson, Frank Harary: Minimum degree games for graphs. Discrete Mathematics 128(1-3): 151-163 (1994)

Frank Harary, Terry A. McKee: The square of a chordal graph. Discrete Mathematics 128(1-3): 165-172 (1994)

Frank Harary, Serge Lawrencenko, Vladimir P. Korzhik: Realizing the chromatic numbers of triangulations of surfaces. Discrete Mathematics 122(1-3): 197-204 (1993)

Niall Graham, Frank Harary, Marilynn Livingston, Quentin F. Stout: Subcube Fault-Tolerance in Hypercubes. Inf. Comput. 102(2): 280-314 (1993)

Frank Harary, John P. Hayes: Edge fault tolerance in graphs. Networks 23(2): 135-142 (1993)

Niall Graham, Frank Harary: Changing and Unchanging the Diameter of a Hypercube. Discrete Applied Mathematics 37/38: 265-274 (1992)

Frank Harary: Graph theory. Addison-Wesley 1991, isbn 978-0-201-02787-7, pp. I-V, 1-274

Curtiss Barefoot, Frank Harary, Kathryn F. Jones: What is the difference between the domination and independent domination numbers of a cubic graph? Graphs and Combinatorics 7(2): 205-208 (1991)

Fred Buckley, Frank Harary: Distance in graphs. Addison-Wesley 1990, isbn 978-0-201-09591-3, pp. I-VII, 1-335

Frank Harary: The graph of a boolean function. J. Exp. Theor. Artif. Intell. 1(2): 163-169 (1989)

Frank Harary, Michael Plantholt: Classification of interpolation theorems for spanning trees and other families of spanning subgraphs. Journal of Graph Theory 13(6): 703-712 (1989)

Fred Buckley, Frank Harary: On the euclidean dimension of a wheel. Graphs and Combinatorics 4(1): 23-30 (1988)

Frank Harary: In memory of Torrence Parsons, 1941-1987. Journal of Graph Theory 12(2): iii-ii (1988)

Frank Harary: The Integral of a Tree. J. Inf. Sci. Eng. 4(1): 87-92 (1988)

Fred Buckley, Lynne L. Doty, Frank Harary: On graphs with signed inverses. Networks 18(3): 151-157 (1988)

Frank Harary, Josef Lauri: The class reconstruction number of maximal planar graphs. Graphs and Combinatorics 3(1): 45-53 (1987)

Frank Harary, Peter J. Slater: A Linear Algorithm for the Cutting Center of a Tree. Inf. Process. Lett. 23(6): 317-319 (1986)

Gary Chartrand, Frank Harary, Ortrud R. Oellermann: On the regulation number of a multigraph. Graphs and Combinatorics 1(1): 137-144 (1985)

Frank Harary, Robert W. Robinson: Isomorphic factorizations VIII: Bisectable trees. Combinatorica 4(2): 169-179 (1984)

Douglas Bauer, Frank Harary, Juhani Nieminen, Charles L. Suffel: Domination alteration sets in graphs. Discrete Mathematics 47: 153-161 (1983)

Frank Harary: Conditional connectivity. Networks 13(3): 347-357 (1983)

Takao Asano, Nobuji Saito, Geoffrey Exoo, Frank Harary: The smallest 2-connected cubic bipartite planar nonhamiltonian graph. Discrete Mathematics 38(1): 1-6 (1982)

Frank Harary, Robert A. Melter, Uri N. Peled, Ioan Tomescu: Boolean distance for graphs. Discrete Mathematics 39(2): 123-127 (1982)

Frank Harary, Bernt Lindström, Hans-olov Zetterström: On balance in group graphs. Networks 12(3): 317-321 (1982)

A. K. Dewdney, Frank Harary: Oriented two-dimensional circuits. Discrete Mathematics 33(2): 149-162 (1981)

Frank Boesch, Frank Harary, Jerald A. Kabell: Graphs as models of communication network vulnerability: Connectivity and persistence. Networks 11(1): 57-63 (1981)

Jin Akiyama, Frank Boesch, Hiroshi Era, Frank Harary, Ralph Tindell: The cohesiveness of a point of a graph. Networks 11(1): 65-68 (1981)

Jin Akiyama, Geoffrey Exoo, Frank Harary: Covering and packing in graphs IV: Linear arboricity. Networks 11(1): 69-72 (1981)

Andreas Blass, Frank Harary, Zevi Miller: Which trees are link graphs? J. Comb. Theory, Ser. B 29(3): 277-292 (1980)

Frank Harary, Jerald A. Kabell: A simple algorithm to detect balance in signed graphs. Mathematical Social Sciences 1(1): 131-136 (1980)

Frank Harary, Jerald A. Kabell: Monotone sequences of graphical invariants. Networks 10(3): 273-275 (1980)

Frank Harary: Graph Theoretic Models. Theor. Comput. Sci. 11: 117-121 (1980)

Francis T. Boesch, Frank Harary: Unicyclic realizability of a degree list. Networks 8(2): 93-96 (1978)

Frank Harary, Allen J. Schwenk: Generalized ramsey theory for graphs VII: Ramsey numbers for multigraphs and networks. Networks 8(3): 209-216 (1978)

Frank Harary, Allen J. Schwenk: On Tactical Configurations with No Four-Cycles. J. Comb. Theory, Ser. A 20(3): 371-374 (1976)

Frank Harary, Geert C. E. Prins: Generalized Ramsey theory for graphs IV, the Ramsey multiplicity of a graph. Networks 4(2): 163-173 (1974)

Frank Harary, Abraham Lempel: On clique-extremal (p, q)-graphs. Networks 4(4): 371-378 (1974)

Frank Harary, Edgar M. Palmer: Graphical enumeration. Addison-Wesley 1973, isbn 978-0-12-324245-7, pp. I-XIV, 1-271

David Hsiao, Frank Harary: A formal system for information retrieval from files. Commun. ACM 13(2): 67-73 (1970)

J. W. Evans, Frank Harary, M. S. Lynn: On the computer enumeration of finite topologies. Commun. ACM 10(5): 295-297 (1967)

Frank Harary, Edgar M. Palmer: Enumeration of Finite Automata. Information and Control 10(5): 499-508 (1967)

Frank Harary: On the Consistency of Precedence Matrices. J. ACM 7(3): 255-259 (1960)

Frank Harary: Note on Carnap's Relational Asymptotic Relative Frequencies. J. Symb. Log. 23(3): 257-260 (1958)

Frank Harary: On Complete Atomic Proper Relation Algebras. J. Symb. Log. 15(3): 197-198 (1950)