The following pages link to Frank Harary (Q293362):
Displaying 50 items.
- (Q202742) (redirect page) (← links)
- Breaking symmetry in complete graphs by orienting edges: asymptotic bounds (Q293364) (← links)
- (Q578917) (redirect page) (← links)
- A linear algorithm for the cutting center of a tree (Q578919) (← links)
- The number of perfect matchings in a hypercube (Q580373) (← links)
- Domination alteration sets in graphs (Q585222) (← links)
- The derived signed graph of a digraph (Q594103) (← links)
- On eccentricity sequences of connected graphs (Q624147) (← links)
- The spectral approach to determining the number of walks in a graph (Q754888) (← links)
- On local balance and \(n\)-balance in signed graphs (Q767122) (← links)
- On the number of dissimilar line-subgraphs of a given graph (Q767435) (← links)
- Note on the Polya and Otter formulas for enumerating trees (Q768049) (← links)
- Note on an enumeration theorem of Davis and Slepian (Q768202) (← links)
- The number of dissimilar supergraphs of a linear graph (Q768986) (← links)
- The number of oriented graphs (Q769577) (← links)
- The number of homeomorphically irreducible trees, and other species (Q770044) (← links)
- On the number of bi-colored graphs (Q770045) (← links)
- On the group of the composition of two graphs (Q770764) (← links)
- The number of functional digraphs (Q771155) (← links)
- Some properties of line digraphs (Q773873) (← links)
- Smallest cubic graphs with prescribed properties (Q801931) (← links)
- What is the difference between the domination and independent domination numbers of a cubic graph? (Q804588) (← links)
- Destroying automorphisms by fixing nodes (Q856873) (← links)
- On the structure of a triangle-free infinite-chromatic graph of Gyarfas (Q1053028) (← links)
- Isomorphic factorizations VIII: Bisectable trees (Q1060225) (← links)
- On the regulation number of a multigraph (Q1068843) (← links)
- Hamiltonian threshold graphs (Q1080870) (← links)
- Achievement and avoidance games for generating Abelian groups (Q1092825) (← links)
- Embedding and characterization of quantum chemical reaction graphs on two-dimensional orientable surfaces (Q1095919) (← links)
- On the Euclidean dimension of a wheel (Q1101119) (← links)
- The starlike trees which span a hypercube (Q1102977) (← links)
- Covering and packing in graphs. V. Mispacking subcubes in hypercubes (Q1102983) (← links)
- A survey of the theory of hypercube graphs (Q1102985) (← links)
- Cubical graphs and cubical dimensions (Q1102987) (← links)
- Node-graceful graphs (Q1104944) (← links)
- Variations on the Ising problem (Q1115451) (← links)
- Geodetic contraction games on graphs (Q1124532) (← links)
- A graph theoretic approach to matrix inversion by partitioning (Q1130837) (← links)
- A graph and its complement with specified properties. VI: Chromatic and achromatic numbers (Q1132109) (← links)
- The smallest regular graphs with irregular square (Q1134161) (← links)
- Extremal graphs with given connectivities (Q1134770) (← links)
- Generalized Ramsey theory for graphs, X: Double stars (Q1139609) (← links)
- Digraphs with real and Gaussian spectra (Q1140093) (← links)
- The forcibly-tree and forcibly-unicyclic degree sequences (Q1140668) (← links)
- A graph and its complement with specified properties. III: Girth and circumference (Q1142784) (← links)
- On the color partitions of a graph (Q1143402) (← links)
- The smallest graphs with certain adjacency properties (Q1145705) (← links)
- Which trees are link graphs? (Q1146683) (← links)
- Graph theoretic models (Q1148340) (← links)
- On the spectrum of a complete multipartite graph (Q1149453) (← links)
