Frank Harary

2007
49	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
48	EE	David Erwin, Frank Harary: Destroying automorphisms by fixing nodes. Discrete Mathematics 306(24): 3244-3252 (2006)
2005
47	EE	Frank Harary, Wolfgang Slany, Oleg Verbitsky: On the Computational Complexity of the Forcing Chromatic Number. STACS 2005: 182-193
46	EE	Frank Harary, Desh Ranjan: Identity orientation of complete bipartite graphs. Discrete Mathematics 290(2/3): 173-182 (2005)
2004
45	EE	Frank Harary, Wolfgang Slany, Oleg Verbitsky: On Computational Complexity of the Forcing Chromatic Number CoRR cs.CC/0406044: (2004)
44	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)
43	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
42	EE	Frank Harary: Preface. Discrete Mathematics 272(1): 1-2 (2003)
41	EE	Daniela Ferrero, Frank Harary: Edge Sums of Debruijn Interconnection Networks. Int. J. Comput. Math. 80(7): 819-824 (2003)
2002
40	EE	Frank Harary, Gopal Gupta: A constraint logic programming approach for generating all perfect matchings. Appl. Math. Lett. 15(8): 969-973 (2002)
39	EE	Fred Buckley, Frank Harary: Unsolved Problems on Distance in Graphs. Electronic Notes in Discrete Mathematics 11: 89-97 (2002)
38	EE	Ophir Frieder, Frank Harary, Peng-Jun Wan: A Radio Coloring of a Hypercube. Int. J. Comput. Math. 79(6): 665-670 (2002)
37	EE	Gary Chartrand, Frank Harary, Ping Zhang: On the geodetic number of a graph. Networks 39(1): 1-6 (2002)
2001
36	EE	Frank Harary, Wolfgang Slany, Oleg Verbitsky: A Symmetric Strategy in Graph Avoidance Games CoRR cs.DM/0110049: (2001)
35	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)
34	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
33		Frank Harary, Teresa W. Haynes: Double Domination in Graphs. Ars Comb. 55: (2000)
32		Gary Chartrand, Frank Harary, Ping Zhang: On the Hall Number of a Graph. Ars Comb. 57: (2000)
31		Maria Satratzemi, Constantine Tsouros, Frank Harary: An Heuristic Algorithm for Handling Multiple Responses. J. Heuristics 6(2): 269-282 (2000)
30	EE	Frank Harary: The Automorphism Group of a Hypercube. J. UCS 6(1): 136-138 (2000)
1999
29	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
28	EE	Frank Harary, Desh Ranjan: Breaking Symmetry in Complete Graphs by Orienting Edges: Asymptotic Bounds. Inf. Process. Lett. 67(5): 227-230 (1998)
1997
27	EE	Mario Gionfriddo, Frank Harary, Zsolt Tuza: The color cost of a caterpillar. Discrete Mathematics 174(1-3): 125-130 (1997)
1996
26	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)
25	EE	Frank Harary, Teresa W. Haynes: Nordhaus-Gaddum inequalities for domination in graphs. Discrete Mathematics 155(1-3): 99-105 (1996)
24	EE	Frank Harary, John P. Hayes: Node fault tolerance in graphs. Networks 27(1): 19-23 (1996)
1995
23	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
22	EE	Frank Harary: Sum graphs over all the integers. Discrete Mathematics 124(1-3): 99-105 (1994)
21	EE	Daniel M. Gordon, Robert W. Robinson, Frank Harary: Minimum degree games for graphs. Discrete Mathematics 128(1-3): 151-163 (1994)
20	EE	Frank Harary, Terry A. McKee: The square of a chordal graph. Discrete Mathematics 128(1-3): 165-172 (1994)
1993
19	EE	Frank Harary, Serge Lawrencenko, Vladimir P. Korzhik: Realizing the chromatic numbers of triangulations of surfaces. Discrete Mathematics 122(1-3): 197-204 (1993)
18		Niall Graham, Frank Harary, Marilynn Livingston, Quentin F. Stout: Subcube Fault-Tolerance in Hypercubes Inf. Comput. 102(2): 280-314 (1993)
1992
17	EE	Niall Graham, Frank Harary: Changing and Unchanging the Diameter of a Hypercube. Discrete Applied Mathematics 37/38: 265-274 (1992)
1988
16	EE	Frank Harary: The Integral of a Tree. J. Inf. Sci. Eng. 4(1): 87-92 (1988)
1986
15		Frank Harary, Peter J. Slater: A Linear Algorithm for the Cutting Center of a Tree. Inf. Process. Lett. 23(6): 317-319 (1986)
1984
14		Frank Harary, Robert W. Robinson: Isomorphic factorizations VIII: Bisectable trees. Combinatorica 4(2): 169-179 (1984)
1983
13	EE	Douglas Bauer, Frank Harary, Juhani Nieminen, Charles L. Suffel: Domination alteration sets in graphs. Discrete Mathematics 47: 153-161 (1983)
1982
12	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)
11	EE	Frank Harary, Robert A. Melter, Uri N. Peled, Ioan Tomescu: Boolean distance for graphs. Discrete Mathematics 39(2): 123-127 (1982)
1981
10	EE	A. K. Dewdney, Frank Harary: Oriented two-dimensional circuits. Discrete Mathematics 33(2): 149-162 (1981)
1980
9	EE	Andreas Blass, Frank Harary, Zevi Miller: Which trees are link graphs? J. Comb. Theory, Ser. B 29(3): 277-292 (1980)
8	EE	Frank Harary, Jerald A. Kabell: A simple algorithm to detect balance in signed graphs. Mathematical Social Sciences 1(1): 131-136 (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	[44]
2	Takao Asano	[12]
3	Curtiss Barefoot	[23]
4	Douglas Bauer	[13]
5	Lowell W. Beineke	[34]
6	Andreas Blass	[9]
7	Fred Buckley	[39]
8	Karen Casey	[23]
9	Gary Chartrand	[29] [32] [37]
10	A. K. Dewdney (Alexander Keewatin Dewdney)	[10]
11	David Erwin	[48]
12	J. W. Evans	[5]
13	Geoffrey Exoo	[12]
14	Daniela Ferrero	[41]
15	David C. Fisher	[23]
16	Kathryn Fraughnaugh	[23]
17	Ophir Frieder	[38]
18	Mario Gionfriddo	[27]
19	Daniel M. Gordon	[21]
20	Niall Graham	[17] [18]
21	Gopal Gupta	[40]
22	John P. Hayes	[24]
23	Teresa W. Haynes	[25] [33]
24	Jerald A. Kabell	[8]
25	Vladimir P. Korzhik	[19]
26	Vladik Kreinovich	[35]
27	Serge Lawrencenko (Serge Lavrenchenko)	[19]
28	Meng-Hiot Lim	[44]
29	Marilynn Livingston	[18]
30	Luc Longpré	[35]
31	M. S. Lynn	[5]
32	Terry A. McKee	[20]
33	Robert A. Melter	[11]
34	Paul G. Mezey	[26]
35	Zevi Miller	[9]
36	Juhani Nieminen	[13]
37	Ed Palmer	[4]
38	Uri N. Peled	[11]
39	William Randolph	[26]
40	Desh Ranjan	[28] [46]
41	Robert W. Robinson	[14] [21]
42	Nobuji Saito	[12]
43	Maria Satratzemi (Maya Satratzemi)	[31]
44	Allen J. Schwenk	[6]
45	Wolfgang Slany	[36] [43] [45] [47] [49]
46	Peter J. Slater	[15]
47	Quentin F. Stout	[18]
48	Charles L. Suffel	[13]
49	Ioan Tomescu	[11]
50	Constantine Tsouros	[31]
51	Zsolt Tuza	[27]
52	Oleg Verbitsky	[36] [43] [45] [47] [49]
53	Peng-Jun Wan	[38]
54	Donald C. Wunsch II (Donald C. Wunsch)	[44]
55	Bill Quan Yue	[29]
56	Ping Zhang	[32] [37]

Colors in the list of coauthors