dblp.uni-trier.dewww.dagstuhl.dewww.uni-trier.de

Frank Harary Coauthor index pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2007
57Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrank Harary, Wolfgang Slany, Oleg Verbitsky: On the Computational Complexity of the Forcing Chromatic Number. SIAM J. Comput. 37(1): 1-19 (2007)
2006
56Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Erwin, Frank Harary: Destroying automorphisms by fixing nodes. Discrete Mathematics 306(24): 3244-3252 (2006)
2005
55Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrank Harary, Wolfgang Slany, Oleg Verbitsky: On the Computational Complexity of the Forcing Chromatic Number. STACS 2005: 182-193
54Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrank Harary, Desh Ranjan: Identity orientation of complete bipartite graphs. Discrete Mathematics 290(2/3): 173-182 (2005)
2004
53Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrank Harary, Wolfgang Slany, Oleg Verbitsky: On Computational Complexity of the Forcing Chromatic Number CoRR cs.CC/0406044: (2004)
52Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrank 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)
51Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrank Harary, Wolfgang Slany, Oleg Verbitsky: On the lengths of symmetry breaking-preserving games on graphs. Theor. Comput. Sci. 303(3): 427-446 (2004)
2003
50Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrank Harary: Preface. Discrete Mathematics 272(1): 1-2 (2003)
49Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaniela Ferrero, Frank Harary: Edge Sums of Debruijn Interconnection Networks. Int. J. Comput. Math. 80(7): 819-824 (2003)
2002
48Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrank Harary, Gopal Gupta: A constraint logic programming approach for generating all perfect matchings. Appl. Math. Lett. 15(8): 969-973 (2002)
47Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFred Buckley, Frank Harary: Unsolved Problems on Distance in Graphs. Electronic Notes in Discrete Mathematics 11: 89-97 (2002)
46Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLOphir Frieder, Frank Harary, Peng-Jun Wan: A Radio Coloring of a Hypercube. Int. J. Comput. Math. 79(6): 665-670 (2002)
45Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGary Chartrand, Frank Harary, Ping Zhang: On the geodetic number of a graph. Networks 39(1): 1-6 (2002)
2001
44Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrank Harary, Wolfgang Slany, Oleg Verbitsky: A Symmetric Strategy in Graph Avoidance Games CoRR cs.DM/0110049: (2001)
43Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrank Harary, Vladik Kreinovich, Luc Longpré: A new graph characteristic and its application to numerical computability. Inf. Process. Lett. 77(5-6): 277-282 (2001)
42Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLowell 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
41no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrank Harary, Teresa W. Haynes: Double Domination in Graphs. Ars Comb. 55: (2000)
40no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGary Chartrand, Frank Harary, Ping Zhang: On the Hall Number of a Graph. Ars Comb. 57: (2000)
39Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMaria Satratzemi, Constantine Tsouros, Frank Harary: An Heuristic Algorithm for Handling Multiple Responses. J. Heuristics 6(2): 269-282 (2000)
38Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrank Harary: The Automorphism Group of a Hypercube. J. UCS 6(1): 136-138 (2000)
1999
37Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGary 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
36Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrank Harary, Desh Ranjan: Breaking Symmetry in Complete Graphs by Orienting Edges: Asymptotic Bounds. Inf. Process. Lett. 67(5): 227-230 (1998)
1997
35Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMario Gionfriddo, Frank Harary, Zsolt Tuza: The color cost of a caterpillar. Discrete Mathematics 174(1-3): 125-130 (1997)
1996
34Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrank 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)
33Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrank Harary, Teresa W. Haynes: Nordhaus-Gaddum inequalities for domination in graphs. Discrete Mathematics 155(1-3): 99-105 (1996)
32Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrank Harary, John P. Hayes: Node fault tolerance in graphs. Networks 27(1): 19-23 (1996)
1995
31Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCurtiss 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
30Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrank Harary: Sum graphs over all the integers. Discrete Mathematics 124(1-3): 99-105 (1994)
29Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaniel M. Gordon, Robert W. Robinson, Frank Harary: Minimum degree games for graphs. Discrete Mathematics 128(1-3): 151-163 (1994)
28Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrank Harary, Terry A. McKee: The square of a chordal graph. Discrete Mathematics 128(1-3): 165-172 (1994)
1993
27Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrank Harary, Serge Lawrencenko, Vladimir P. Korzhik: Realizing the chromatic numbers of triangulations of surfaces. Discrete Mathematics 122(1-3): 197-204 (1993)
26Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNiall Graham, Frank Harary, Marilynn Livingston, Quentin F. Stout: Subcube Fault-Tolerance in Hypercubes Inf. Comput. 102(2): 280-314 (1993)
1992
25Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNiall Graham, Frank Harary: Changing and Unchanging the Diameter of a Hypercube. Discrete Applied Mathematics 37/38: 265-274 (1992)
1991
24no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrank Harary: Graph theory. Addison-Wesley 1991: I-V, 1-274
23Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCurtiss 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)
1990
22no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFred Buckley, Frank Harary: Distance in graphs. Addison-Wesley 1990: I-VII, 1-335
1989
21Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrank Harary: The graph of a boolean function. J. Exp. Theor. Artif. Intell. 1(2): 163-169 (1989)
1988
20Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFred Buckley, Frank Harary: On the euclidean dimension of a wheel. Graphs and Combinatorics 4(1): 23-30 (1988)
19Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrank Harary: The Integral of a Tree. J. Inf. Sci. Eng. 4(1): 87-92 (1988)
1987
18Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrank Harary, Josef Lauri: The class reconstruction number of maximal planar graphs. Graphs and Combinatorics 3(1): 45-53 (1987)
1986
17Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrank Harary, Peter J. Slater: A Linear Algorithm for the Cutting Center of a Tree. Inf. Process. Lett. 23(6): 317-319 (1986)
1985
16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGary Chartrand, Frank Harary, Ortrud R. Oellermann: On the regulation number of a multigraph. Graphs and Combinatorics 1(1): 137-144 (1985)
1984
15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrank Harary, Robert W. Robinson: Isomorphic factorizations VIII: Bisectable trees. Combinatorica 4(2): 169-179 (1984)
1983
14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDouglas Bauer, Frank Harary, Juhani Nieminen, Charles L. Suffel: Domination alteration sets in graphs. Discrete Mathematics 47: 153-161 (1983)
1982
13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTakao Asano, Nobuji Saito, Geoffrey Exoo, Frank Harary: The smallest 2-connected cubic bipartite planar nonhamiltonian graph. Discrete Mathematics 38(1): 1-6 (1982)
12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrank Harary, Robert A. Melter, Uri N. Peled, Ioan Tomescu: Boolean distance for graphs. Discrete Mathematics 39(2): 123-127 (1982)
1981
11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLA. K. Dewdney, Frank Harary: Oriented two-dimensional circuits. Discrete Mathematics 33(2): 149-162 (1981)
1980
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndreas Blass, Frank Harary, Zevi Miller: Which trees are link graphs? J. Comb. Theory, Ser. B 29(3): 277-292 (1980)
9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrank Harary, Jerald A. Kabell: A simple algorithm to detect balance in signed graphs. Mathematical Social Sciences 1(1): 131-136 (1980)
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrank Harary: Graph Theoretic Models. Theor. Comput. Sci. 11: 117-121 (1980)
1976
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrank Harary, Allen J. Schwenk: On Tactical Configurations with No Four-Cycles. J. Comb. Theory, Ser. A 20(3): 371-374 (1976)
1973
6no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrank Harary, Edgar M. Palmer: Graphical enumeration. Addison-Wesley 1973: I-XIV, 1-271
1967
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJ. W. Evans, Frank Harary, M. S. Lynn: On the computer enumeration of finite topologies. Commun. ACM 10(5): 295-297 (1967)
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrank Harary, Edgar M. Palmer: Enumeration of Finite Automata Information and Control 10(5): 499-508 (1967)
1960
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrank Harary: On the Consistency of Precedence Matrices. J. ACM 7(3): 255-259 (1960)
1958
2no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrank Harary: Note on Carnap's Relational Asymptotic Relative Frequencies. J. Symb. Log. 23(3): 257-260 (1958)
1950
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrank Harary: On Complete Atomic Proper Relation Algebras. J. Symb. Log. 15(3): 197-198 (1950)

Coauthor Index

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

Colors in the list of coauthors

Last update Thu May 31 18:55:10 2012 CET by the DBLP TeamThis material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page