On algorithms for finding all circuits of a graph

Bibliography: p. [37]-[39]

Analysis of algorithms for finding all spanning trees of a graph.

"Supported in part by the following grants: US NSF GJ 217, US NSF GJ 812, and project BUILD."

On the ordering, enumeration and ranking of k-ary trees /

"UILU-ENG 77 1706."

Decomposition of graphs into trees /

"UILU-ENG 77 1715."

Canonical simplification of finite objects, well quasi-ordered by tree embedding /

"UILU-ENG 79 1727."

Picture analysis by graph transformation,

"Supported in part by the Department of Computer Science and the Atomic Energy Commission under contract US AEC AT(11-1)2118."

On the complexity of edge labelings for trees /

"UILU-ENG 78 1740."

A generalization of Ramsey theory for graphs, with stars and complete graphs as forbidden subgraphs /

Includes bibliographical references.

Average analysis of simple path algorithms /

"UILU-ENG 77 1759."

Graph transformations for composite formation,

"C00-1018-1195."

The eigenvalue problem in the OL/2 language /

Originally presented as the author's thesis (M.S.), University of Illinois at Urbana-Champaign.

Enumerations of ordered trees /

Errata slip inserted.

A generalization of Ramsey theory for graphs /

Bibliography: p. 16.

Extension of the Huffman tree construction algorithm /

Bibliography: p. 42-43.

Generation and comparison of equivalent equation sets in a general purpose simulation and modeling package /

"C00-2383-0018."