Frank Harary

2007
47	EE	Frank Harary, Wolfgang Slany, Oleg Verbitsky: On the Computational Complexity of the Forcing Chromatic Number. SIAM J. Comput. 37(1): 1-19 (2007)
2006
46	EE	David Erwin, Frank Harary: Destroying automorphisms by fixing nodes. Discrete Mathematics 306(24): 3244-3252 (2006)
2005
45	EE	Frank Harary, Wolfgang Slany, Oleg Verbitsky: On the Computational Complexity of the Forcing Chromatic Number. STACS 2005: 182-193
44	EE	Frank Harary, Desh Ranjan: Identity orientation of complete bipartite graphs. Discrete Mathematics 290(2/3): 173-182 (2005)
2004
43	EE	Frank Harary, Wolfgang Slany, Oleg Verbitsky: On Computational Complexity of the Forcing Chromatic Number CoRR cs.CC/0406044: (2004)
42	EE	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)
41	EE	Frank Harary, Wolfgang Slany, Oleg Verbitsky: On the lengths of symmetry breaking-preserving games on graphs. Theor. Comput. Sci. 303(3): 427-446 (2004)
2003
40	EE	Frank Harary: Preface. Discrete Mathematics 272(1): 1-2 (2003)
39	EE	Daniela Ferrero, Frank Harary: Edge Sums of Debruijn Interconnection Networks. Int. J. Comput. Math. 80(7): 819-824 (2003)
2002
38	EE	Frank Harary, Gopal Gupta: A constraint logic programming approach for generating all perfect matchings. Appl. Math. Lett. 15(8): 969-973 (2002)
37	EE	Ophir Frieder, Frank Harary, Peng-Jun Wan: A Radio Coloring of a Hypercube. Int. J. Comput. Math. 79(6): 665-670 (2002)
36	EE	Gary Chartrand, Frank Harary, Ping Zhang: On the geodetic number of a graph. Networks 39(1): 1-6 (2002)
2001
35	EE	Frank Harary, Wolfgang Slany, Oleg Verbitsky: A Symmetric Strategy in Graph Avoidance Games CoRR cs.DM/0110049: (2001)
34	EE	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)
33	EE	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)
2000
32		Frank Harary, Teresa W. Haynes: Double Domination in Graphs. Ars Comb. 55: (2000)
31		Gary Chartrand, Frank Harary, Ping Zhang: On the Hall Number of a Graph. Ars Comb. 57: (2000)
30		Maria Satratzemi, Constantine Tsouros, Frank Harary: An Heuristic Algorithm for Handling Multiple Responses. J. Heuristics 6(2): 269-282 (2000)
29	EE	Frank Harary: The Automorphism Group of a Hypercube. J. UCS 6(1): 136-138 (2000)
1999
28	EE	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)
1998
27	EE	Frank Harary, Desh Ranjan: Breaking Symmetry in Complete Graphs by Orienting Edges: Asymptotic Bounds. Inf. Process. Lett. 67(5): 227-230 (1998)
1997
26	EE	Mario Gionfriddo, Frank Harary, Zsolt Tuza: The color cost of a caterpillar. Discrete Mathematics 174(1-3): 125-130 (1997)
1996
25	EE	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)
24	EE	Frank Harary, Teresa W. Haynes: Nordhaus-Gaddum inequalities for domination in graphs. Discrete Mathematics 155(1-3): 99-105 (1996)
23	EE	Frank Harary, John P. Hayes: Node fault tolerance in graphs. Networks 27(1): 19-23 (1996)
1995
22	EE	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)
1994
21	EE	Frank Harary: Sum graphs over all the integers. Discrete Mathematics 124(1-3): 99-105 (1994)
20	EE	Daniel M. Gordon, Robert W. Robinson, Frank Harary: Minimum degree games for graphs. Discrete Mathematics 128(1-3): 151-163 (1994)
19	EE	Frank Harary, Terry A. McKee: The square of a chordal graph. Discrete Mathematics 128(1-3): 165-172 (1994)
1993
18	EE	Frank Harary, Serge Lawrencenko, Vladimir P. Korzhik: Realizing the chromatic numbers of triangulations of surfaces. Discrete Mathematics 122(1-3): 197-204 (1993)
17		Niall Graham, Frank Harary, Marilynn Livingston, Quentin F. Stout: Subcube Fault-Tolerance in Hypercubes Inf. Comput. 102(2): 280-314 (1993)
1992
16	EE	Niall Graham, Frank Harary: Changing and Unchanging the Diameter of a Hypercube. Discrete Applied Mathematics 37/38: 265-274 (1992)
1988
15	EE	Frank Harary: The Integral of a Tree. J. Inf. Sci. Eng. 4(1): 87-92 (1988)
1986
14		Frank Harary, Peter J. Slater: A Linear Algorithm for the Cutting Center of a Tree. Inf. Process. Lett. 23(6): 317-319 (1986)
1984
13		Frank Harary, Robert W. Robinson: Isomorphic factorizations VIII: Bisectable trees. Combinatorica 4(2): 169-179 (1984)
1983
12	EE	Douglas Bauer, Frank Harary, Juhani Nieminen, Charles L. Suffel: Domination alteration sets in graphs. Discrete Mathematics 47: 153-161 (1983)
1982
11	EE	Takao Asano, Nobuji Saito, Geoffrey Exoo, Frank Harary: The smallest 2-connected cubic bipartite planar nonhamiltonian graph. Discrete Mathematics 38(1): 1-6 (1982)
10	EE	Frank Harary, Robert A. Melter, Uri N. Peled, Ioan Tomescu: Boolean distance for graphs. Discrete Mathematics 39(2): 123-127 (1982)
1981
9	EE	A. K. Dewdney, Frank Harary: Oriented two-dimensional circuits. Discrete Mathematics 33(2): 149-162 (1981)
1980
8	EE	Andreas Blass, Frank Harary, Zevi Miller: Which trees are link graphs? J. Comb. Theory, Ser. B 29(3): 277-292 (1980)
7		Frank Harary: Graph Theoretic Models. Theor. Comput. Sci. 11: 117-121 (1980)
1976
6		Frank Harary, Allen J. Schwenk: On Tactical Configurations with No Four-Cycles. J. Comb. Theory, Ser. A 20(3): 371-374 (1976)
1967
5	EE	J. W. Evans, Frank Harary, M. S. Lynn: On the computer enumeration of finite topologies. Commun. ACM 10(5): 295-297 (1967)
4		Frank Harary, Ed Palmer: Enumeration of Finite Automata Information and Control 10(5): 499-508 (1967)
1960
3	EE	Frank Harary: On the Consistency of Precedence Matrices. J. ACM 7(3): 255-259 (1960)
1958
2		Frank Harary: Note on Carnap's Relational Asymptotic Relative Frequencies. J. Symb. Log. 23(3): 257-260 (1958)
1950
1		Frank Harary: On Complete Atomic Proper Relation Algebras. J. Symb. Log. 15(3): 197-198 (1950)

Coauthor Index

1	Amit Agarwal	[42]
2	Takao Asano	[11]
3	Curtiss Barefoot	[22]
4	Douglas Bauer	[12]
5	Lowell W. Beineke	[33]
6	Andreas Blass	[8]
7	Karen Casey	[22]
8	Gary Chartrand	[28] [31] [36]
9	A. K. Dewdney (Alexander Keewatin Dewdney)	[9]
10	David Erwin	[46]
11	J. W. Evans	[5]
12	Geoffrey Exoo	[11]
13	Daniela Ferrero	[39]
14	David C. Fisher	[22]
15	Kathryn Fraughnaugh	[22]
16	Ophir Frieder	[37]
17	Mario Gionfriddo	[26]
18	Daniel M. Gordon	[20]
19	Niall Graham	[16] [17]
20	Gopal Gupta	[38]
21	John P. Hayes	[23]
22	Teresa W. Haynes	[24] [32]
23	Vladimir P. Korzhik	[18]
24	Vladik Kreinovich	[34]
25	Serge Lawrencenko (Serge Lavrenchenko)	[18]
26	Meng-Hiot Lim	[42]
27	Marilynn Livingston	[17]
28	Luc Longpré	[34]
29	M. S. Lynn	[5]
30	Terry A. McKee	[19]
31	Robert A. Melter	[10]
32	Paul G. Mezey	[25]
33	Zevi Miller	[8]
34	Juhani Nieminen	[12]
35	Ed Palmer	[4]
36	Uri N. Peled	[10]
37	William Randolph	[25]
38	Desh Ranjan	[27] [44]
39	Robert W. Robinson	[13] [20]
40	Nobuji Saito	[11]
41	Maria Satratzemi (Maya Satratzemi)	[30]
42	Allen J. Schwenk	[6]
43	Wolfgang Slany	[35] [41] [43] [45] [47]
44	Peter J. Slater	[14]
45	Quentin F. Stout	[17]
46	Charles L. Suffel	[12]
47	Ioan Tomescu	[10]
48	Constantine Tsouros	[30]
49	Zsolt Tuza	[26]
50	Oleg Verbitsky	[35] [41] [43] [45] [47]
51	Peng-Jun Wan	[37]
52	Donald C. Wunsch	[42]
53	Bill Quan Yue	[28]
54	Ping Zhang	[31] [36]

Colors in the list of coauthors