default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFrank Harary
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2000 – 2009
- 2007
[j110]Frank Harary, Wolfgang Slany, Oleg Verbitsky
:
On the Computational Complexity of the Forcing Chromatic Number. SIAM J. Comput. 37(1): 1-19 (2007)- 2006
- [j109]David Erwin, Frank Harary:
Destroying automorphisms by fixing nodes. Discret. Math. 306(24): 3244-3252 (2006) - 2005
- [j108]Frank Harary, Desh Ranjan:
Identity orientation of complete bipartite graphs. Discret. Math. 290(2/3): 173-182 (2005) - [c2]Frank Harary, Wolfgang Slany, Oleg Verbitsky:
On the Computational Complexity of the Forcing Chromatic Number. STACS 2005: 182-193 - 2004
- [j107]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) - [j106]Frank Harary, Wolfgang Slany, Oleg Verbitsky:
On the lengths of symmetry breaking-preserving games on graphs. Theor. Comput. Sci. 313(3): 427-446 (2004) - [i2]Frank Harary, Wolfgang Slany, Oleg Verbitsky:
On Computational Complexity of the Forcing Chromatic Number. CoRR cs.CC/0406044 (2004) - 2003
- [j105]Frank Harary:
Preface. Discret. Math. 272(1): 1-2 (2003) - [j104]Daniela Ferrero, Frank Harary:
Edge Sums of Debruijn Interconnection Networks. Int. J. Comput. Math. 80(7): 819-824 (2003) - 2002
- [j103]Frank Harary, Gopal Gupta:
A constraint logic programming approach for generating all perfect matchings. Appl. Math. Lett. 15(8): 969-973 (2002) - [j102]Fred Buckley, Frank Harary:
Unsolved Problems on Distance in Graphs. Electron. Notes Discret. Math. 11: 89-97 (2002) - [j101]Ophir Frieder, Frank Harary, Peng-Jun Wan:
A Radio Coloring of a Hypercube. Int. J. Comput. Math. 79(6): 665-670 (2002) - [j100]Gary Chartrand, Frank Harary, Ping Zhang:
On the geodetic number of a graph. Networks 39(1): 1-6 (2002) - 2001
- [j99]Frank Harary, Michael S. Jacobson:
Destroying symmetry by orienting edges: Complete graphs and complete bigraphs. Discuss. Math. Graph Theory 21(2): 149-158 (2001) - [j98]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) - [j97]Lowell W. Beineke, Frank Harary:
On the Maximum Number of Cyclic Triples in Oriented Graphs. J. Comb. Theory B 81(2): 165-176 (2001) - [c1]Frank Harary:
Early Computer Science Adventures of a Mathematician. DMTCS 2001: 1-4 - [i1]Frank Harary, Wolfgang Slany, Oleg Verbitsky:
A Symmetric Strategy in Graph Avoidance Games. CoRR cs.DM/0110049 (2001) - 2000
- [j96]Gary Chartrand, Linda Eroh, Frank Harary, Ping Zhang:
How large can the domination numbers of a graph be? Australas. J Comb. 21: 23-36 (2000) - [j95]Frank Harary, Teresa W. Haynes:
Double Domination in Graphs. Ars Comb. 55 (2000) - [j94]Gary Chartrand, Frank Harary, Ping Zhang:
On the Hall Number of a Graph. Ars Comb. 57 (2000) - [j93]Gary Chartrand, Frank Harary, Ping Zhang:
Geodetic sets in graphs. Discuss. Math. Graph Theory 20(1): 129-138 (2000) - [j92]Maria Satratzemi, Constantine Tsouros, Frank Harary:
An Heuristic Algorithm for Handling Multiple Responses. J. Heuristics 6(2): 269-282 (2000) - [j91]Frank Harary:
The Automorphism Group of a Hypercube. J. Univers. Comput. Sci. 6(1): 136-138 (2000)
1990 – 1999
- 1999
- [j90]Gary Chartrand, Frank Harary, Bill Quan Yue:
On the out-domination and in-domination numbers of a digraph. Discret. Math. 197-198: 179-183 (1999) - 1998
- [j89]Frank Harary, Desh Ranjan:
Breaking Symmetry in Complete Graphs by Orienting Edges: Asymptotic Bounds. Inf. Process. Lett. 67(5): 227-230 (1998) - 1997
- [j88]Mario Gionfriddo, Frank Harary, Zsolt Tuza:
The color cost of a caterpillar. Discret. Math. 174(1-3): 125-130 (1997) - [j87]Frank Harary, Stavros D. Nikolopoulos:
On complete systems of invariants for small graphs. Int. J. Comput. Math. 64(1-2): 35-46 (1997) - 1996
- [j86]Frank Harary, William Randolph, Paul G. Mezey:
A Study of Maximum Unit-circle Caterpillars - Tools for the Study of the Shape of Adsorption Patterns. Discret. Appl. Math. 67(1-3): 127-135 (1996) - [j85]Frank Harary, Teresa W. Haynes:
Nordhaus-Gaddum inequalities for domination in graphs. Discret. Math. 155(1-3): 99-105 (1996) - [j84]Frank Harary, John P. Hayes:
Node fault tolerance in graphs. Networks 27(1): 19-23 (1996) - 1995
- [j83]Curtiss Barefoot, Karen Casey, David C. Fisher, Kathryn Fraughnaugh, Frank Harary:
Size in maximal triangle-free graphs and minimal graphs of diameter 2. Discret. Math. 138(1-3): 93-99 (1995) - [j82]Frank Harary, Mohammed Khurrum:
One node fault tolerance for caterpillars and starlike trees. Int. J. Comput. Math. 56(3-4): 135-143 (1995) - 1994
- [j81]Frank Harary:
Sum graphs over all the integers. Discret. Math. 124(1-3): 99-105 (1994) - [j80]Daniel M. Gordon, Robert W. Robinson, Frank Harary:
Minimum degree games for graphs. Discret. Math. 128(1-3): 151-163 (1994) - [j79]Frank Harary, Terry A. McKee:
The square of a chordal graph. Discret. Math. 128(1-3): 165-172 (1994) - 1993
- [j78]Frank Harary, Martin Lewinter:
Which graphs are pluperfect? Australas. J Comb. 7: 81-86 (1993) - [j77]Frank Harary, Serge Lawrencenko, Vladimir P. Korzhik:
Realizing the chromatic numbers of triangulations of surfaces. Discret. Math. 122(1-3): 197-204 (1993) - [j76]Niall Graham, Frank Harary, Marilynn Livingston, Quentin F. Stout:
Subcube Fault-Tolerance in Hypercubes. Inf. Comput. 102(2): 280-314 (1993) - [j75]Frank Harary, John P. Hayes:
Edge fault tolerance in graphs. Networks 23(2): 135-142 (1993) - 1992
- [j74]Niall Graham, Frank Harary:
Changing and Unchanging the Diameter of a Hypercube. Discret. Appl. Math. 37/38: 265-274 (1992) - 1991
- [b3]Frank Harary:
Graph theory. Addison-Wesley 1991, ISBN 978-0-201-02787-7, pp. I-V, 1-274 - [j73]Curtiss Barefoot, Frank Harary, Kathryn Fraughnaugh Jones:
What is the difference between the domination and independent domination numbers of a cubic graph? Graphs Comb. 7(2): 205-208 (1991) - 1990
- [b2]Fred Buckley, Frank Harary:
Distance in graphs. Addison-Wesley 1990, ISBN 978-0-201-09591-3, pp. I-VII, 1-335
1980 – 1989
- 1989
- [j72]Frank Harary:
The graph of a boolean function. J. Exp. Theor. Artif. Intell. 1(2): 163-169 (1989) - [j71]Frank Harary, Michael Plantholt:
Classification of interpolation theorems for spanning trees and other families of spanning subgraphs. J. Graph Theory 13(6): 703-712 (1989) - 1988
- [j70]Frank Harary, Paul G. Mezey:
Embedding and characterization of quantum chemical reaction graphs on two-dimensional orientable surfaces. Discret. Appl. Math. 19(1-3): 205-214 (1988) - [j69]Fred Buckley, Frank Harary:
On the euclidean dimension of a wheel. Graphs Comb. 4(1): 23-30 (1988) - [j68]Frank Harary:
In memory of Torrence Parsons, 1941-1987. J. Graph Theory 12(2): iii-ii (1988) - [j67]Frank Harary:
The Integral of a Tree. J. Inf. Sci. Eng. 4(1): 87-92 (1988) - [j66]Fred Buckley, Lynne L. Doty, Frank Harary:
On graphs with signed inverses. Networks 18(3): 151-157 (1988) - 1987
- [j65]Frank Harary, Uri N. Peled:
Hamiltonian threshold graphs. Discret. Appl. Math. 16(1): 11-15 (1987) - [j64]Frank Harary, Josef Lauri:
The class reconstruction number of maximal planar graphs. Graphs Comb. 3(1): 45-53 (1987) - 1986
- [j63]Frank Harary, Peter J. Slater:
A Linear Algorithm for the Cutting Center of a Tree. Inf. Process. Lett. 23(6): 317-319 (1986) - [j62]Per Hage, Frank Harary:
Some genuine graph models in anthropology. J. Graph Theory 10(3): 353-361 (1986) - [j61]Frank Harary:
Editorial: Changing of the guard. J. Graph Theory 10(3): i (1986) - [j60]Frank Harary:
Graph theory as applied mathematics. J. Graph Theory 10(3): iii-iv (1986) - 1985
- [j59]Frank Harary, J. Richard Lundgren, John S. Maybee:
On signed digraphs with all cycles negative. Discret. Appl. Math. 12(2): 155-164 (1985) - [j58]Gary Chartrand, Frank Harary, Ortrud R. Oellermann:
On the regulation number of a multigraph. Graphs Comb. 1(1): 137-144 (1985) - [j57]Frank Harary, Robert W. Robinson:
Isomorphic factorizations X: Unsolved problems. J. Graph Theory 9(1): 67-86 (1985) - [j56]Frank Harary, Michael Plantholt:
The graph reconstruction number. J. Graph Theory 9(4): 451-454 (1985) - 1984
- [j55]Frank Harary, Robert W. Robinson:
Isomorphic factorizations VIII: Bisectable trees. Comb. 4(2): 169-179 (1984) - [j54]Frank Harary, Robert W. Robinson:
The rediscovery of Redfield's papers. J. Graph Theory 8(2): 191-193 (1984) - [j53]Frank Harary, Robert A. Melter, Ioan Tomescu:
Digital metrics: A graph-theoretical approach. Pattern Recognit. Lett. 2(3): 159-163 (1984) - 1983
- [j52]Douglas Bauer, Frank Harary, Juhani Nieminen, Charles L. Suffel:
Domination alteration sets in graphs. Discret. Math. 47: 153-161 (1983) - [j51]Frank Harary:
A tribute to Frank P. Ramsey, 1903-1930. J. Graph Theory 7(1): 1-7 (1983) - [j50]Frank Harary, Peter Kovács:
Regular graphs with given girth pair. J. Graph Theory 7(2): 209-218 (1983) - [j49]Frank Harary:
In praise of paul erdös on his seventieth. J. Graph Theory 7(4): 385-390 (1983) - [j48]Frank Harary:
Conditional connectivity. Networks 13(3): 347-357 (1983) - 1982
- [j47]Takao Asano, Nobuji Saito, Geoffrey Exoo, Frank Harary:
The smallest 2-connected cubic bipartite planar nonhamiltonian graph. Discret. Math. 38(1): 1-6 (1982) - [j46]Frank Harary, Robert A. Melter, Uri N. Peled, Ioan Tomescu:
Boolean distance for graphs. Discret. Math. 39(2): 123-127 (1982) - [j45]Frank Harary:
Homage to roberto frucht. J. Graph Theory 6(2): 97-99 (1982) - [j44]Frank Harary, Bernt Lindström, Hans-olov Zetterström:
On balance in group graphs. Networks 12(3): 317-321 (1982) - 1981
- [j43]A. K. Dewdney, Frank Harary:
Oriented two-dimensional circuits. Discret. Math. 33(2): 149-162 (1981) - [j42]Jin Akiyama, Frank Harary:
A graph and its complement with specified properties. IV. Counting self-complementary blocks. J. Graph Theory 5(1): 103-107 (1981) - [j41]Frank Harary:
Homage to the memory of Kazimierz Kuratowski. J. Graph Theory 5(3): 217-219 (1981) - [j40]Andreas Blass, Geoffrey Exoo, Frank Harary:
Paley graphs satisfy all first-order adjacency axioms. J. Graph Theory 5(4): 435-439 (1981) - [j39]Frank Boesch, Frank Harary, Jerald A. Kabell:
Graphs as models of communication network vulnerability: Connectivity and persistence. Networks 11(1): 57-63 (1981) - [j38]Jin Akiyama, Frank Boesch, Hiroshi Era, Frank Harary, Ralph Tindell:
The cohesiveness of a point of a graph. Networks 11(1): 65-68 (1981) - [j37]Jin Akiyama, Geoffrey Exoo, Frank Harary:
Covering and packing in graphs IV: Linear arboricity. Networks 11(1): 69-72 (1981) - 1980
- [j36]Friedrich Esser, Frank Harary:
Digraphs with real and gaussian spectra. Discret. Appl. Math. 2(2): 113-124 (1980) - [j35]Geoffrey Exoo, Frank Harary:
The smallest graphs with certain adjacency properties. Discret. Math. 29(1): 25-32 (1980) - [j34]Friedrich Esser, Frank Harary:
On the Spectrum of a Complete Multipartite Graph. Eur. J. Comb. 1(3): 211-218 (1980) - [j33]Andreas Blass, Frank Harary, Zevi Miller:
Which trees are link graphs? J. Comb. Theory B 29(3): 277-292 (1980) - [j32]Richard A. Brualdi, Frank Harary, Zevi Miller:
Bigraphs versus digraphs via matrices. J. Graph Theory 4(1): 51-73 (1980) - [j31]Jonathan L. Gross, Frank Harary:
Some problems in topological graph theory. J. Graph Theory 4(3): 253-263 (1980) - [j30]Frank Harary, Jerald A. Kabell:
A simple algorithm to detect balance in signed graphs. Math. Soc. Sci. 1(1): 131-136 (1980) - [j29]Frank Harary, Jerald A. Kabell:
Monotone sequences of graphical invariants. Networks 10(3): 273-275 (1980) - [j28]Frank Harary:
Graph Theoretic Models. Theor. Comput. Sci. 11: 117-121 (1980)
1970 – 1979
- 1979
- [j27]Frank Harary, Helene J. Kommel:
The graphs with only self-dual signings. Discret. Math. 26(3): 235-241 (1979) - [j26]Jerrold W. Grossman, Frank Harary, Maria M. Klawe:
Generalized ramsey theory for graphs, x: double stars. Discret. Math. 28(3): 247-254 (1979) - [j25]William T. Trotter, Frank Harary:
On double and multiple interval graphs. J. Graph Theory 3(3): 205-211 (1979) - [j24]Martin Grötschel, Frank Harary:
The graphs for which all strong orientations are hamiltonian. J. Graph Theory 3(3): 221-223 (1979) - [j23]Andreas Blass, Frank Harary:
Properties of almost all graphs and complexes. J. Graph Theory 3(3): 225-240 (1979) - 1978
- [j22]Francis T. Boesch, Frank Harary:
Unicyclic realizability of a degree list. Networks 8(2): 93-96 (1978) - [j21]Frank Harary, Allen J. Schwenk:
Generalized ramsey theory for graphs VII: Ramsey numbers for multigraphs and networks. Networks 8(3): 209-216 (1978) - 1977
- [j20]Frank Harary, Gary Chartrand:
Editorial. J. Graph Theory 1(1): 1-2 (1977) - [j19]Frank Harary, Derbiau Hsu, Zevi Miller:
The biparticity of a graph. J. Graph Theory 1(2): 131-133 (1977) - [j18]Frank Harary, Robert W. Robinson, Nicholas C. Wormald:
The divisibility theorem for isomorphic factorizations of complete graphs. J. Graph Theory 1(2): 187-188 (1977) - [j17]Frank Harary:
Homage to george pólya. J. Graph Theory 1(4): 289-290 (1977) - [j16]Frank Harary, Edgar M. Palmer, Robert W. Robinson, Allen J. Schwenk:
Enumeration of graphs with signed points and lines. J. Graph Theory 1(4): 295-308 (1977) - 1976
- [j15]Frank Harary, Allen J. Schwenk:
On Tactical Configurations with No Four-Cycles. J. Comb. Theory A 20(3): 371-374 (1976) - 1975
- [j14]Frank Harary, Edgar M. Palmer, Ronald C. Read:
On the cell-growth problem for arbitrary polygons. Discret. Math. 11(3): 371-389 (1975) - 1974
- [j13]Frank Harary, Geert C. E. Prins:
Generalized Ramsey theory for graphs IV, the Ramsey multiplicity of a graph. Networks 4(2): 163-173 (1974) - [j12]Frank Harary, Abraham Lempel:
On clique-extremal (p, q)-graphs. Networks 4(4): 371-378 (1974) - 1973
- [b1]Frank Harary, Edgar M. Palmer:
Graphical enumeration. Addison-Wesley 1973, ISBN 978-0-12-324245-7, pp. I-XIV, 1-271 - [j11]Frank Harary, Allen J. Schwenk:
The number of caterpillars. Discret. Math. 6(4): 359-365 (1973) - 1972
- [j10]Frank Harary, M. J. Piff, D. J. A. Welsh:
On the automorphism group of a matroid. Discret. Math. 2(2): 163-171 (1972) - 1971
- [j9]Frank Harary, Phillip A. Ostrand:
The cutting center theorem for trees. Discret. Math. 1(1): 7-18 (1971) - 1970
- [j8]David Hsiao, Frank Harary:
A formal system for information retrieval from files. Commun. ACM 13(2): 67-73 (1970) - [j7]Frank Harary, Benjamin Lipstein, George P. H. Styan:
A Matrix Approach to Nonstationary Chains. Oper. Res. 18(6): 1168-1181 (1970)
1960 – 1969
- 1967
- [j6]J. W. Evans, Frank Harary, M. Stuart Lynn:
On the computer enumeration of finite topologies. Commun. ACM 10(5): 295-297 (1967) - [j5]Frank Harary, Edgar M. Palmer:
Enumeration of Finite Automata. Inf. Control. 10(5): 499-508 (1967) - 1960
- [j4]Frank Harary:
On the Consistency of Precedence Matrices. J. ACM 7(3): 255-259 (1960)
1950 – 1959
- 1959
- [j3]Frank Harary:
Graph theory and electric networks. IRE Trans. Inf. Theory 5(5): 95-109 (1959) - 1958
- [j2]Frank Harary:
Note on Carnap's Relational Asymptotic Relative Frequencies. J. Symb. Log. 23(3): 257-260 (1958) - 1950
- [j1]Frank Harary:
On Complete Atomic Proper Relation Algebras. J. Symb. Log. 15(3): 197-198 (1950)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:32 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
