The following reports and/or related drafts have been
cited in the literature and are provided here in pdf
format for reference.
"Path-Regular Graphs", D.W. Matula and D. Dolev, Report No.
STAN – CS – 80 – 807, Dept. of Comp. Sci., Stanford
"The Largest Clique Size in a Random Graph",
D.W. Matula, Tech Report CS 7608, Department of
Computer Science and Engineering, Southern Methodist
"On the Complete Subgraphs of
a Random Graph", D.W. Matula, Proc. Of the Second Chapel Hill Conference
on Combinatorial Mathematics and Its Applications, University of North
Carolina, Chapel Hill, 1970, 356-369.
Employee Party Problem" (Clique Number of a Random
Graph), D.W. Matula, Notices Am. Math. Soc., 19,
Feb.1972, A – 382
"A Natural Rooted Tree Enumeration by Prime Factorization", SIAM Rev. 10, 1968, p.273.
contributing authors have provided the following documents as a means to ensure
timely dissemination of scholarly and technical work on a noncommercial basis.
Copyright and all rights therein are maintained by the authors or by other
copyright holders, notwithstanding that they have offered their works here
electronically. It is understood that all persons copying this information will
adhere to the terms and constraints invoked by each author's copyright. These
works may not be reposted without the explicit permission of the copyright
contents of these Web pages are the sole responsibility of Dr. David Matula, (firstname.lastname@example.org) and do not
necessarily represent the opinions or policies of Southern Methodist