The following pages link to Frank Harary (Q293362):
Displaying 50 items.
- Oriented two-dimensional circuits (Q1154476) (← links)
- Regular graphs containing a given graph (Q1155628) (← links)
- The smallest 2-connected cubic bipartite planar nonhamiltonian graph (Q1158439) (← links)
- Boolean distance for graphs (Q1160140) (← links)
- Smallest cubic and quartic graphs with a given number of cutpoints and bridges (Q1163574) (← links)
- The smallest cubic multigraphs with prescribed bipartite, block, Hamiltonian and planar properties (Q1164057) (← links)
- Convexity in graphs (Q1168332) (← links)
- A simple algorithm to detect balance in signed graphs (Q1170207) (← links)
- Changing and unchanging the diameter of a hypercube (Q1199429) (← links)
- Subcube fault-tolerance in hypercubes (Q1207961) (← links)
- On the cell-growth problem for arbitrary polygons (Q1215640) (← links)
- The communication problem on graphs (Q1217715) (← links)
- On tactical configurations with no four-cycles (Q1230630) (← links)
- On ''The tantalizer'' and ''Instant insanity'' (Q1244253) (← links)
- Cutpoints in the conjunction of two graphs (Q1247437) (← links)
- Generalized Ramsey theory. IX: Isomorphic factorizations. IV: Isomorphic Ramsey numbers (Q1249194) (← links)
- Consistency in marked digraphs (Q1254330) (← links)
- A graph and its complement with specified properties. I: Connectivity (Q1258310) (← links)
- The graphs with only self-dual signings (Q1258314) (← links)
- Knots and graphs. I: Arc graphs and colorings (Q1284502) (← links)
- On the out-domination and in-domination numbers of a digraph (Q1292825) (← links)
- The neighborhood inclusion structure of a graph (Q1310225) (← links)
- Vulnerability in graphs of diameter four (Q1310232) (← links)
- Hypercubes, shuffle-exchange graphs and de Bruijn digraphs (Q1310233) (← links)
- Abstract sphere-of-influence graphs (Q1310234) (← links)
- Spanning subgraphs of a hypercube. IV: Rooted trees (Q1310235) (← links)
- The geodetic number of a graph (Q1310238) (← links)
- Quantifying fault recovery in multiprocessor systems (Q1310239) (← links)
- Variations on a hypercube: Embellishments of parallel architectures (Q1310240) (← links)
- Sum graphs over all the integers (Q1313829) (← links)
- Realizing the chromatic numbers of triangulations of surfaces (Q1313860) (← links)
- Minimum degree games for graphs (Q1322180) (← links)
- The square of a chordal graph (Q1322181) (← links)
- Parallel concepts in graph theory (Q1324287) (← links)
- The e-mail gossip number and the connected domination number (Q1372291) (← links)
- The color cost of a caterpillar (Q1377806) (← links)
- Some small sized spanning subgraphs of a hypercube (Q1388974) (← links)
- The irregularity cost of a graph (Q1388975) (← links)
- An heuristic algorithm for handling multiple responses (Q1583918) (← links)
- A new graph characteristic and its application to numerical computability (Q1603419) (← links)
- Identity orientation of complete bipartite graphs (Q1772415) (← links)
- The class reconstruction number of maximal planar graphs (Q1820795) (← links)
- Size in maximal triangle-free graphs and minimal graphs of diameter 2 (Q1842148) (← links)
- On the maximum number of cyclic triples in oriented graphs (Q1850518) (← links)
- Methods of destroying the symmetries of a graph (Q1872551) (← links)
- On the lengths of symmetry breaking-preserving games on graphs (Q1885002) (← links)
- A study of maximum unit-circle caterpillars---tools for the study of the shape of adsorption patterns (Q1917331) (← links)
- Nordhaus-Gaddum inequalities for domination in graphs (Q1923485) (← links)
- Independent domination in hypercubes (Q2367974) (← links)
- The irregularity cost or sum of a graph (Q2367986) (← links)
