The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Frank Harary: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

Search in 0.004secs, Finished in 0.007secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002