- About
-
The Global ETD Search service is a free service for researchers
to find electronic theses and dissertations. This service is
provided by the
Networked Digital Library of Theses and Dissertations.
Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
Search results
Showing 1 to 9 of 9 (0.107 seconds)Spelling suggestions: "subject:"graph theory. combinatorial analysis."" "subject:"graph theory. ombinatorial analysis.""
| 1 |
Counting combinatorial structures in recursively constructible graphs /Leung, Yiu-cho. January 2007 (has links)
Thesis (Ph.D.)--Hong Kong University of Science and Technology, 2007. / Includes bibliographical references (leaves 121-126). Also available in electronic version.
|
| 2 |
Bounding the number of graphs containing very long induced paths /Butler, Steven Kay, January 2003 (has links) (PDF)
Thesis (M.S.)--Brigham Young University. Dept. of Mathematics, 2003. / Includes bibliographical references (p. 32).
|
| 3 |
k-star decomposition of lambda-fold complete multipartite graphsAnzur, Matthew Paul, January 2007 (has links) (PDF)
Thesis (Ph.D.)--Auburn University, 2007. / Abstract. Vita. Includes bibliographic references (ℓ. 39)
|
| 4 |
Designs on cubic multigraphs.Carter, Janine Elizabeth. Rosa, A. Unknown Date (has links)
Thesis (Ph.D.)--McMaster University (Canada), 1989. / Source: Dissertation Abstracts International, Volume: 62-13, Section: A, page: 0000.
|
| 5 |
Almost self-complementary graphs and extensions.Das, Pramod Kumar. Rosa, Alexnander. Unknown Date (has links)
Thesis (Ph.D.)--McMaster University (Canada), 1989. / Source: Dissertation Abstracts International, Volume: 62-13, Section: A, page: 0000.
|
| 6 |
Combinatorial aspects of leaf-labelled trees : a thesis submitted in partial fulfilment of the requirements for the degree of Doctor of Philosophy in Mathematics, University of Canterbury Department of Mathematics and Statistics /Humphries, Peter J. January 2008 (has links)
Thesis (Ph. D.)--University of Canterbury, 2008. / Typescript (photocopy). Includes bibliographical references and index. Also available via the World Wide Web.
|
| 7 |
Maximum frustration of bipartite signed graphsBowlin, Garry. January 2009 (has links)
Thesis (Ph. D.)--State University of New York at Binghamton, Department of Mathematical Sciences, 2009. / Includes bibliographical references.
|
| 8 |
R(W₅, K₅)=27 /Stinehour, Joshua. January 2004 (has links)
Thesis (M.S.)--Rochester Institute of Technology, 2004. / Typescript. Includes bibliographical references (leaves 71-75).
|
| 9 |
Sink free orientations in a graphSivanathan, Gowrishankar. January 2009 (has links)
Thesis (M.S.)--State University of New York at Binghamton, Thomas J. Watson School of Engineering and Applied Science, Department of Computer Science, 2009. / Includes bibliographical references.
|
Page generated in 0.1118 seconds