Frank Harary

From MaRDI portal
Person:293362

Available identifiers

zbMath Open harary.frankWikidataQ1443394 ScholiaQ1443394MaRDI QIDQ293362

List of research outcomes

PublicationDate of PublicationType
Breaking symmetry in complete graphs by orienting edges: asymptotic bounds2016-06-09Paper
https://portal.mardi4nfdi.de/entity/Q31131882012-02-08Paper
https://portal.mardi4nfdi.de/entity/Q30200332011-07-29Paper
On eccentricity sequences of connected graphs2011-02-08Paper
LUNE-FREE KNOT GRAPHS2008-08-19Paper
On the Computational Complexity of the Forcing Chromatic Number2008-03-28Paper
Destroying automorphisms by fixing nodes2006-12-14Paper
https://portal.mardi4nfdi.de/entity/Q33782872006-03-30Paper
On the codomination number of a graph2006-03-23Paper
Counting circular caterpillars2006-03-23Paper
https://portal.mardi4nfdi.de/entity/Q33775442006-03-23Paper
STACS 20052005-12-02Paper
https://portal.mardi4nfdi.de/entity/Q57085602005-11-18Paper
https://portal.mardi4nfdi.de/entity/Q27159782005-07-20Paper
Identity orientation of complete bipartite graphs2005-04-18Paper
Algorithms for derivation of structurally stable Hamiltonian signed graphs2005-02-28Paper
On the lengths of symmetry breaking-preserving games on graphs2004-10-27Paper
Signed graphs for portfolio analysis in risk management2004-05-18Paper
https://portal.mardi4nfdi.de/entity/Q44588442004-03-15Paper
Edge Sums Of De Bruijn Interconnection Networks2004-02-11Paper
Methods of destroying the symmetries of a graph2003-07-06Paper
https://portal.mardi4nfdi.de/entity/Q43291472003-02-11Paper
Destroying symmetry by orienting edges: Complete graphs and complete bigraphs2002-12-11Paper
A Radio Coloring of a Hypercube2002-12-11Paper
On the maximum number of cyclic triples in oriented graphs2002-12-10Paper
The Shields-Harary indices of vulnerability of a graph2002-11-18Paper
Identification of the Liaison Persons of an Organization Using the Structure Matrix2002-10-22Paper
Graph Theoretic Methods in the Management Sciences2002-10-22Paper
Connect-It Games2002-10-17Paper
https://portal.mardi4nfdi.de/entity/Q45521962002-08-29Paper
https://portal.mardi4nfdi.de/entity/Q43291292002-08-14Paper
https://portal.mardi4nfdi.de/entity/Q27651702002-07-22Paper
A new graph characteristic and its application to numerical computability2002-07-14Paper
On the geodetic number of a graph2002-04-08Paper
On the out-domination and in-domination numbers of a digraph2002-01-27Paper
https://portal.mardi4nfdi.de/entity/Q27165192002-01-02Paper
https://portal.mardi4nfdi.de/entity/Q44077152002-01-01Paper
An heuristic algorithm for handling multiple responses2001-12-05Paper
https://portal.mardi4nfdi.de/entity/Q27069532001-10-03Paper
Geodetic sets in graphs2001-03-30Paper
https://portal.mardi4nfdi.de/entity/Q45208252001-02-27Paper
https://portal.mardi4nfdi.de/entity/Q44892422000-12-13Paper
https://portal.mardi4nfdi.de/entity/Q49344012000-08-03Paper
https://portal.mardi4nfdi.de/entity/Q44885552000-07-09Paper
https://portal.mardi4nfdi.de/entity/Q49339342000-06-27Paper
https://portal.mardi4nfdi.de/entity/Q49535522000-05-09Paper
Some small sized spanning subgraphs of a hypercube2000-03-05Paper
Knots and graphs. I: Arc graphs and colorings1999-04-26Paper
https://portal.mardi4nfdi.de/entity/Q42282281999-02-02Paper
https://portal.mardi4nfdi.de/entity/Q38382301999-01-11Paper
https://portal.mardi4nfdi.de/entity/Q42117481998-12-15Paper
https://portal.mardi4nfdi.de/entity/Q43897651998-11-26Paper
The irregularity cost of a graph1998-11-17Paper
https://portal.mardi4nfdi.de/entity/Q42117511998-10-07Paper
https://portal.mardi4nfdi.de/entity/Q43933041998-06-08Paper
https://portal.mardi4nfdi.de/entity/Q43877161998-05-13Paper
The color cost of a caterpillar1998-05-06Paper
The e-mail gossip number and the connected domination number1998-03-16Paper
https://portal.mardi4nfdi.de/entity/Q43616371998-03-02Paper
On complete systems of invariants for small graphs1997-08-07Paper
https://portal.mardi4nfdi.de/entity/Q27857131997-07-20Paper
https://portal.mardi4nfdi.de/entity/Q43394301997-07-08Paper
https://portal.mardi4nfdi.de/entity/Q48878191997-03-31Paper
https://portal.mardi4nfdi.de/entity/Q31264481997-03-31Paper
Nordhaus-Gaddum inequalities for domination in graphs1997-02-17Paper
Animal-trees and caterpillars are equivalent1997-01-09Paper
https://portal.mardi4nfdi.de/entity/Q48878041997-01-05Paper
https://portal.mardi4nfdi.de/entity/Q48877301996-12-09Paper
https://portal.mardi4nfdi.de/entity/Q48711651996-09-29Paper
https://portal.mardi4nfdi.de/entity/Q48731731996-09-29Paper
A study of maximum unit-circle caterpillars---tools for the study of the shape of adsorption patterns1996-08-04Paper
ON THE DICHROMATIC INDEX OF A DIGRAPH1996-07-31Paper
https://portal.mardi4nfdi.de/entity/Q48819311996-07-16Paper
https://portal.mardi4nfdi.de/entity/Q48761661996-07-01Paper
One node fault tolerance for caterpillars and starlike trees1996-06-23Paper
https://portal.mardi4nfdi.de/entity/Q48805201996-06-09Paper
https://portal.mardi4nfdi.de/entity/Q48622211996-05-30Paper
https://portal.mardi4nfdi.de/entity/Q48634231996-04-22Paper
https://portal.mardi4nfdi.de/entity/Q48737401996-04-22Paper
https://portal.mardi4nfdi.de/entity/Q48737411996-04-22Paper
https://portal.mardi4nfdi.de/entity/Q48578871996-01-24Paper
Size in maximal triangle-free graphs and minimal graphs of diameter 21995-10-03Paper
https://portal.mardi4nfdi.de/entity/Q46975081995-05-01Paper
The geodetic number of a graph1994-12-21Paper
Quantifying fault recovery in multiprocessor systems1994-12-21Paper
Variations on a hypercube: Embellishments of parallel architectures1994-12-21Paper
Minimum degree games for graphs1994-12-01Paper
Parallel concepts in graph theory1994-10-13Paper
https://portal.mardi4nfdi.de/entity/Q43091511994-10-12Paper
The neighborhood inclusion structure of a graph1994-09-11Paper
https://portal.mardi4nfdi.de/entity/Q42945941994-07-13Paper
Abstract sphere-of-influence graphs1994-07-03Paper
Vulnerability in graphs of diameter four1994-06-28Paper
Spanning subgraphs of a hypercube. IV: Rooted trees1994-06-28Paper
Hypercubes, shuffle-exchange graphs and de Bruijn digraphs1994-06-23Paper
https://portal.mardi4nfdi.de/entity/Q42947221994-06-05Paper
Two graph-colouring games1994-05-30Paper
The square of a chordal graph1994-05-05Paper
Sum graphs over all the integers1994-03-10Paper
Realizing the chromatic numbers of triangulations of surfaces1994-03-01Paper
https://portal.mardi4nfdi.de/entity/Q56880891994-01-01Paper
Edge fault tolerance in graphs1993-09-05Paper
Independent domination in hypercubes1993-08-19Paper
The irregularity cost or sum of a graph1993-08-19Paper
https://portal.mardi4nfdi.de/entity/Q52878641993-08-05Paper
https://portal.mardi4nfdi.de/entity/Q46923911993-06-05Paper
https://portal.mardi4nfdi.de/entity/Q40329861993-05-18Paper
Subcube fault-tolerance in hypercubes1993-05-16Paper
Changing and unchanging the diameter of a hypercube1993-01-16Paper
https://portal.mardi4nfdi.de/entity/Q40204591993-01-16Paper
https://portal.mardi4nfdi.de/entity/Q39905791992-06-28Paper
https://portal.mardi4nfdi.de/entity/Q39831011992-06-27Paper
https://portal.mardi4nfdi.de/entity/Q39832411992-06-27Paper
https://portal.mardi4nfdi.de/entity/Q39840241992-06-27Paper
https://portal.mardi4nfdi.de/entity/Q39842231992-06-27Paper
https://portal.mardi4nfdi.de/entity/Q39842281992-06-27Paper
https://portal.mardi4nfdi.de/entity/Q39845301992-06-27Paper
https://portal.mardi4nfdi.de/entity/Q39721331992-06-25Paper
Spanning subgraphs of a hypercube iii: meshes1992-06-25Paper
What is the difference between the domination and independent domination numbers of a cubic graph?1991-01-01Paper
https://portal.mardi4nfdi.de/entity/Q57525971990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30322911990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q31978461990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34953761990-01-01Paper
Geodetic contraction games on graphs1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38221851989-01-01Paper
On meshy trees1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47298031989-01-01Paper
Classification of interpolation theorems for spanning trees and other families of spanning subgraphs1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34834551989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34963601989-01-01Paper
The number of perfect matchings in a hypercube1988-01-01Paper
Embedding and characterization of quantum chemical reaction graphs on two-dimensional orientable surfaces1988-01-01Paper
On the Euclidean dimension of a wheel1988-01-01Paper
The starlike trees which span a hypercube1988-01-01Paper
Covering and packing in graphs. V. Mispacking subcubes in hypercubes1988-01-01Paper
A survey of the theory of hypercube graphs1988-01-01Paper
Cubical graphs and cubical dimensions1988-01-01Paper
Node-graceful graphs1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37810511988-01-01Paper
On graphs with signed inverses1988-01-01Paper
ON THE CLASS-RECONSTRUCTION NUMBER OF TREES1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38222011988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38280171988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38325171988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47338771988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30337771988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34691261988-01-01Paper
Hamiltonian threshold graphs1987-01-01Paper
Achievement and avoidance games for generating Abelian groups1987-01-01Paper
The class reconstruction number of maximal planar graphs1987-01-01Paper
A Simple Criterion for a Graph to have a Perfect Matching1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37817991987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37833271987-01-01Paper
On Degree Achievement and Avoidance Games for Graphs1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38015941987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38153291987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47262751987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30270331987-01-01Paper
A linear algorithm for the cutting center of a tree1986-01-01Paper
Variations on the Ising problem1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37303781986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37344221986-01-01Paper
Some genuine graph models in anthropology1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37513971986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37896101986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37911651986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38047461986-01-01Paper
GEODETIC GAMES FOR GRAPHS1986-01-01Paper
Minimal blocking flow in networks1986-01-01Paper
On signed digraphs with all cycles negative1985-01-01Paper
On the regulation number of a multigraph1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q51873091985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37052641985-01-01Paper
The curl of graphs and networks1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37105451985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37289351985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37391421985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37416461985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37441801985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37513981985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37588491985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37753571985-01-01Paper
The graph reconstruction number1985-01-01Paper
Isomorphic factorizations X: Unsolved problems1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32206121985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32206271985-01-01Paper
The Diameter of a Graph and its Complement1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36792371985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36808671985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36892201985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36952951985-01-01Paper
Smallest cubic graphs with prescribed properties1984-01-01Paper
Isomorphic factorizations VIII: Bisectable trees1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37151521984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37151541984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37374321984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37673841984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32206331984-01-01Paper
The rediscovery of Redfield's papers1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33358141984-01-01Paper
Digital metrics: A graph-theoretical approach1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33426171984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33442371984-01-01Paper
Regular Digraphs Containing a Given Digraph1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36986791984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37014381984-01-01Paper
Domination alteration sets in graphs1983-01-01Paper
The derived signed graph of a digraph1983-01-01Paper
On the structure of a triangle-free infinite-chromatic graph of Gyarfas1983-01-01Paper
A graph and its complement with specified properties. VI: Chromatic and achromatic numbers1983-01-01Paper
Regular graphs containing a given graph1983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37121481983-01-01Paper
A tribute to Frank P. Ramsey, 1903–19301983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30374731983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30431921983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32222371983-01-01Paper
Interpolation theorem for diameters of spanning trees1983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33106331983-01-01Paper
The degree sets of connected infinite graphs1983-01-01Paper
Regular graphs with given girth pair1983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33312501983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33358201983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33440321983-01-01Paper
Conditional connectivity1983-01-01Paper
Maximum versus minimum invariants for graphs1983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36694401983-01-01Paper
In praise of paul erdös on his seventieth1983-01-01Paper
The forcibly-tree and forcibly-unicyclic degree sequences1982-01-01Paper
The smallest 2-connected cubic bipartite planar nonhamiltonian graph1982-01-01Paper
Boolean distance for graphs1982-01-01Paper
Smallest cubic and quartic graphs with a given number of cutpoints and bridges1982-01-01Paper
The smallest cubic multigraphs with prescribed bipartite, block, Hamiltonian and planar properties1982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37344451982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37442011982-01-01Paper
Homage to roberto frucht1982-01-01Paper
Erratum to "Characterization of (r,s)-Adjacency Graphs of Complexes"1982-01-01Paper
The Trail Number of a Graph1982-01-01Paper
A Point-Symmetric Graph that is Nowhere Reversible1982-01-01Paper
On balance in group graphs1982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47405881982-01-01Paper
Cluster Inference by Using Transitivity Indices in Empirical Graphs1982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47428161982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47506661982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33122731982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33138911982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33138931982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36633381982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36694481982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36792261982-01-01Paper
Oriented two-dimensional circuits1981-01-01Paper
Convexity in graphs1981-01-01Paper
Degree Sequences of Infinite Graphs1981-01-01Paper
The crossing numbers of some generalized Petersen graphs.1981-01-01Paper
Homage to the memory of kazimierz kuratowski1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39105541981-01-01Paper
The cohesiveness of a point of a graph1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39212481981-01-01Paper
Graphs as models of communication network vulnerability: Connectivity and persistence1981-01-01Paper
Paley graphs satisfy all first-order adjacency axioms1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39297531981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39297611981-01-01Paper
Characterization of (r, s)-Adjacency Graphs of Complexes1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39329941981-01-01Paper
Counting balanced signed graphs using marked graphs1981-01-01Paper
Generalized Ramsey theory for graphs XII: Bipartite Ramsey sets1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39344361981-01-01Paper
Covering and packing in graphs IV: Linear arboricity1981-01-01Paper
A graph and its complement with specified properties. IV. Counting self-complementary blocks1981-01-01Paper
Achievement and avoidance games designed from theorems1981-01-01Paper
Digraphs with real and Gaussian spectra1980-01-01Paper
On the color partitions of a graph1980-01-01Paper
The smallest graphs with certain adjacency properties1980-01-01Paper
Which trees are link graphs?1980-01-01Paper
Graph theoretic models1980-01-01Paper
On the spectrum of a complete multipartite graph1980-01-01Paper
A simple algorithm to detect balance in signed graphs1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38522271980-01-01Paper
A graph and its complement with specified properties V: The self‐complement index1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38759531980-01-01Paper
Graphical Completions of a Sequence1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38808681980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38808771980-01-01Paper
Monotone sequences of graphical invariants1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38841491980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38855851980-01-01Paper
Some problems in topological graph theory1980-01-01Paper
An Intuitive Approach to Interval Numbers of Graphs1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38970661980-01-01Paper
Residually-Complete Graphs1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39076061980-01-01Paper
Bigraphs versus digraphs via matrices1980-01-01Paper
The spectral approach to determining the number of walks in a graph1979-01-01Paper
The smallest regular graphs with irregular square1979-01-01Paper
Generalized Ramsey theory for graphs, X: Double stars1979-01-01Paper
A graph and its complement with specified properties. III: Girth and circumference1979-01-01Paper
Generalized Ramsey theory. IX: Isomorphic factorizations. IV: Isomorphic Ramsey numbers1979-01-01Paper
A graph and its complement with specified properties. I: Connectivity1979-01-01Paper
The graphs with only self-dual signings1979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38645561979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38824891979-01-01Paper
The graphs for which all strong orientations are hamiltonian1979-01-01Paper
The probability that a point of a tree is fixed1979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38955021979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39165861979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39242291979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39414391979-01-01Paper
The structure of threshold graphs1979-01-01Paper
Labeled Bipartite Blocks1979-01-01Paper
Isomorphic factorisations V: Directed graphs1979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41921101979-01-01Paper
Matrix measures for transitivity and balance*1979-01-01Paper
On double and multiple interval graphs1979-01-01Paper
Properties of almost all graphs and complexes1979-01-01Paper
Extremal graphs with given connectivities1978-01-01Paper
Cutpoints in the conjunction of two graphs1978-01-01Paper
Consistency in marked digraphs1978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38522241978-01-01Paper
Consistent graphs with signed points1978-01-01Paper
The bichromaticity of a tree1978-01-01Paper
Unicyclic realizability of a degree list1978-01-01Paper
Isomorphic Factorisations. I: Complete Graphs1978-01-01Paper
Generalized ramsey theory for graphs VII: Ramsey numbers for multigraphs and networks1978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41863351978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30504551978-01-01Paper
On The tantalizer and Instant insanity1977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41412751977-01-01Paper
A graph theoretic approach to the investigation of system‐environment relationships†1977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41457321977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41467521977-01-01Paper
Line minimal Boolean forests1977-01-01Paper
The biparticity of a graph1977-01-01Paper
Homage to george pólya1977-01-01Paper
The divisibility theorem for isomorphic factorizations of complete graphs1977-01-01Paper
Enumeration of graphs with signed points and lines1977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41753151977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41848601977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41906531977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30504581977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32052601977-01-01Paper
On tactical configurations with no four-cycles1976-01-01Paper
Anticritical graphs1976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40837031976-01-01Paper
Which Nonnegative Matrices Are Self-Inverse?1976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40919941976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40934801976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41116151976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41119511976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41192371976-01-01Paper
On the planarity of 2-complexes1976-01-01Paper
Line removal algorithms for graphs and their degree lists1976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41863651976-01-01Paper
On the cell-growth problem for arbitrary polygons1975-01-01Paper
Corrections : Generalized Ramsey Theory for Graphs V1975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40687411975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40755001975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40812751975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40826041975-01-01Paper
Point Arboricity Critical Graphs Exist1975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40948981975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41219211975-01-01Paper
The communication problem on graphs1974-01-01Paper
Self-Complementary Generalized Orbits of a Permutation Group1974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40445901974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40445911974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40446011974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40446111974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40446291974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40609951974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40634901974-01-01Paper
On clique-extremal (p,q)-graphs1974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47709741974-01-01Paper
Generalized Ramsey theory for graphs IV, the Ramsey multiplicity of a graph1974-01-01Paper
Generalized Ramsey Theory for Graphs V. the Ramsey Number of a Digraph1974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47773111974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47773141974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47773151974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47773241974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56724801973-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56726671973-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56729211973-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56820131973-01-01Paper
https://portal.mardi4nfdi.de/entity/Q51835161973-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40837091973-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47709781973-01-01Paper
Generalized Ramsey theory for graphs. I: Diagonal numbers1973-01-01Paper
The number of caterpillars1973-01-01Paper
On the number of unique subgraphs1973-01-01Paper
A Maximal Toroidal Graph which is not a Triangulation.1973-01-01Paper
Generalized Ramsey Theory for Graphs. II. Small Diagonal Numbers1972-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56411711972-01-01Paper
Generalized Ramsey theory for graphs1972-01-01Paper
The Two-Triangle Case of the Acquaintance Graph1972-01-01Paper
Graphs Suppressible to an Edge1972-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56526921972-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56555501972-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56595651972-01-01Paper
On the Tree Graph of a Matroid1972-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56706521972-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56775081972-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56820101972-01-01Paper
https://portal.mardi4nfdi.de/entity/Q44049371972-01-01Paper
Generalized Ramsey theory for graphs. III: Small off-diagonal numbers1972-01-01Paper
On the automorphism group of a matroid1972-01-01Paper
Trees with Hamiltonian square1971-01-01Paper
A Graphical Exposition of the Ising Problem1971-01-01Paper
Cospectral Graphs and Digraphs1971-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56325911971-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56116461971-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56167271971-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56176441971-01-01Paper
The cutting center theorem for trees1971-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56296671970-01-01Paper
COVERING AND PACKING IN GRAPHS, I.1970-01-01Paper
A Matrix Approach to Nonstationary Chains1970-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56615191970-01-01Paper
Cubic identity graphs and planar graphs derived from trees1970-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56638931970-01-01Paper
Enumeration under group action: Unsolved graphical enumeration problems, IV1970-01-01Paper
A formal system for information retrieval from files1970-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55906611970-01-01Paper
The achromatic number of a graph1970-01-01Paper
The enumeration of tree-like polyhexes1970-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56109361970-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56175701970-01-01Paper
On the corona of two graphs1970-01-01Paper
Determinants, Permanents and Bipartite Graphs1969-01-01Paper
Labeled trees with unlabeled end-points1969-01-01Paper
Uniquely colorable graphs1969-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55729391969-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55753501969-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55921281969-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55921291969-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55929301969-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56051671969-01-01Paper
On acyclic simplicial complexes1968-01-01Paper
On the point-group and line-group of a graph1968-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55601771968-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55663181968-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55701291968-01-01Paper
Arrow Diagrams are Line Digraphs1968-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55801681968-01-01Paper
On the coloring of signed graphs1968-01-01Paper
Graphs and Matrices1967-01-01Paper
Boolean Operations on Graphs.1967-01-01Paper
On the Core of a Graph1967-01-01Paper
The connectivity function of a graph1967-01-01Paper
A criterion for planarity of the square of a graph1967-01-01Paper
Which Graphs have only Self-Converse Orientations?1967-01-01Paper
On the Möbius Ladders1967-01-01Paper
On the number of balanced signed graphs1967-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55458411967-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55482011967-01-01Paper
On Indecomposable Graphs1967-01-01Paper
Enumeration of finite automata1967-01-01Paper
The Enumeration Methods of Redfield1967-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55788011967-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56044141967-01-01Paper
On the problem of reconstructing a tournament from subtournaments1967-01-01Paper
On the critical lines of a graph1967-01-01Paper
On the point-core of a graph1966-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55087871966-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55095391966-01-01Paper
Connectedness of Products of Two Directed Graphs1966-01-01Paper
The Reconstruction of a Tree from its Maximal Subtrees1966-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55160791966-01-01Paper
The theory of tournaments: A miniature mathematical system1966-01-01Paper
The Theory of Round Robin Tournaments1966-01-01Paper
The power group enumeration theorem1966-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55214931966-01-01Paper
On the order of the group of a planar map1966-01-01Paper
Enumeration of Mixed Graphs1966-01-01Paper
Enumeration of Locally Restricted Digraphs1966-01-01Paper
Enumeration of self‐converse digraphs1966-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55555481966-01-01Paper
Local Restrictions for Various Classes of Directed Graphs1965-01-01Paper
The Genus of the n-Cube1965-01-01Paper
A dual form of Kuratowski’s theorem1965-01-01Paper
The Maximum Number of Strongly Connected Subtournaments*1965-01-01Paper
A Dual form of Kuratowski's Theorem1965-01-01Paper
Inequalities involving the genus of a graph and its thicknesses1965-01-01Paper
The Thickness of the Complete Graph1965-01-01Paper
On Eulerian and Hamiltonian Graphs and Line Graphs1965-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55101901965-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55151421965-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55160781965-01-01Paper
THE POWER GROUP OF TWO PERMUTATION GROUPS1965-01-01Paper
On the dimension of a graph1965-01-01Paper
On the genus of an n-connected graph1964-01-01Paper
https://portal.mardi4nfdi.de/entity/Q57323351964-01-01Paper
On the thickness of the complete graph1964-01-01Paper
A graph theoretic approach to similarity relations1964-01-01Paper
https://portal.mardi4nfdi.de/entity/Q53330611964-01-01Paper
Recent results in topological graph theory1964-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55411071964-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55440871964-01-01Paper
The number of plane trees with a given partition1964-01-01Paper
On the embedding of complete graphs in orientable surfaces1963-01-01Paper
On the Number of Crossings in a Complete Graph1963-01-01Paper
Enumeration of Bicolourable Graphs1963-01-01Paper
A Characterization of Block-Graphs1963-01-01Paper
The Dynamics of Brand Loyalty: A Markovian Approach1962-01-01Paper
A Complementary Problem on Nonplanar Graphs1962-01-01Paper
Every planar graph with nine points has a nonplanar complement1962-01-01Paper
THE MAXIMUM CONNECTIVITY OF A GRAPH1962-01-01Paper
A graph theoretic approach to matrix inversion by partitioning1962-01-01Paper
Remark on the Preceding Note1962-01-01Paper
Additivity of the genus of a graph1962-01-01Paper
The Determinant of the Adjacency Matrix of a Graph1962-01-01Paper
Permutations with Restricted Position1962-01-01Paper
A Very Independent Axiom System1961-01-01Paper
A Parity Relation Partitions Its Field Distinctly1961-01-01Paper
The Number of Lines in a Digraph of Each Connectedness Category1961-01-01Paper
Some properties of line digraphs1960-01-01Paper
Some Historical and Intuitive Aspects of Graph Theory1960-01-01Paper
Dissimilarity Characteristic Theorems for Graphs1960-01-01Paper
A matrix criterion for structural balance1960-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32729721960-01-01Paper
On the Consistency of Precedence Matrices1960-01-01Paper
A Note on Evaluating Determinants1960-01-01Paper
On The Line‐Group of Two‐Terminal Series‐Parallel Networks1959-01-01Paper
The number of homeomorphically irreducible trees, and other species1959-01-01Paper
On the group of the composition of two graphs1959-01-01Paper
The number of functional digraphs1959-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55482051959-01-01Paper
A Graph Theoretic Method for the Complete Reduction of a Matrix with a View Toward Finding its Eigenvalues1959-01-01Paper
An Elementary Theorem on Graphs1959-01-01Paper
Exponentiation of Permutation Groups1959-01-01Paper
The number of oriented graphs1958-01-01Paper
On the number of bi-colored graphs1958-01-01Paper
On the Number of Dissimilar Graphs Between a Given Graph-Subgraph Pair1958-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32524071958-01-01Paper
On the Group of a Graph with Respect To a Subgraph1958-01-01Paper
The number of dissimilar supergraphs of a linear graph1957-01-01Paper
On local balance and \(n\)-balance in signed graphs1956-01-01Paper
On the number of dissimilar line-subgraphs of a given graph1956-01-01Paper
Note on the Polya and Otter formulas for enumerating trees1956-01-01Paper
Note on an enumeration theorem of Davis and Slepian1956-01-01Paper
The Number of Linear, Directed, Rooted, and Connected Graphs1955-01-01Paper
The Dissimilarity Characteristic of Linear Graphs1954-01-01Paper
On the notion of balance of a signed graph1954-01-01Paper
A Characterization of Implicative Boolean Rings1953-01-01Paper
On the Number of Husimi Trees1953-01-01Paper
The Extension of an Arbitrary Boolean Algebra to an Implicative Boolean Algebra1953-01-01Paper
https://portal.mardi4nfdi.de/entity/Q58235741953-01-01Paper
The dissimilarity characteristic of Husimi trees1953-01-01Paper
On the determination of redundancies in sociometric chains1952-01-01Paper
On complete atomic proper relation algebras1950-01-01Paper
Atomic boolean-like rings with finite radical1950-01-01Paper
On the Algebraic Structure of Knots1949-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Frank Harary