NDLTD Global ETD Search
  • Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 758
  • 105
  • 69
  • 58
  • 24
  • 24
  • 16
  • 16
  • 16
  • 16
  • 16
  • 16
  • 14
  • 10
  • 7
  • Tagged with
  • 1396
  • 1396
  • 292
  • 200
  • 154
  • 149
  • 124
  • 122
  • 121
  • 120
  • 119
  • 115
  • 109
  • 107
  • 107
  • 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 131 to 140 of 1396 (0.049 seconds)
131

Topos-like properties in two categories of graphs and graph-like features in an abstract category

Plessas, Demitri Joel. January 2008 (has links)
Thesis (M.A.)--University of Montana, 2008. / Title from title screen. Description based on contents viewed Aug. 21, 2008. Includes bibliographical references (p. 78-79).
Graph theory. Categories (Mathematics)
132

A faster algorithm for the single source shortest path problem with few distinct positive lengths

Williamson, Matthew D. January 2009 (has links)
Thesis (M.S.)--West Virginia University, 2009. / Title from document title page. Document formatted into pages; contains viii, 42 p. : ill. Includes abstract. Includes bibliographical references (p. 41-42).
Algorithms. Graph theory.
133

On straight line representations of random planar graphs /

Choi, In-kyeong. January 1991 (has links)
Thesis (Ph. D.)--Oregon State University, 1992. / Typescript (photocopy). Includes bibliographical references (leaves 49-50). Also available on the World Wide Web.
Random graphs. Graph theory.
134

Use of finite random graphs to model packet radio networks

Wang, Yang. January 1990 (has links)
Thesis (M.S.)--Ohio University, March, 1990. / Title from PDF t.p.
Random graphs. Graph theory.
135

The Shields-Harary number of graphs

Holliday, John Edwin, Johnson, Peter D. January 2004 (has links) (PDF)
Dissertation (Ph.D.)--Auburn University, 2004. / Abstract. Vita. Includes bibliographic references.
Graph theory. Numerical function.
136

Cycles in graph theory and matroids

Zhou, Ju, January 1900 (has links)
Thesis (Ph. D.)--West Virginia University, 2008. / Title from document title page. Document formatted into pages; contains vi, 44 p. : ill. Includes abstract. Includes bibliographical references (p. 42-44).
Hamiltonian graph theory. Matroids.
137

Generalizations of colorability and connectivity of graphs

Zhang, Xiankun, January 1998 (has links)
Thesis (Ph. D.)--West Virginia University, 1998. / Title from document title page. Document formatted into pages; contains vii, 97 p. : ill. Includes abstract. Includes bibliographical references (p. 93-96).
Graph theory. Abelian groups.
138

Fractional domination, fractional packings, and fractional isomorphisms of graphs

Rubalcaba, Roberto Ramon, Johnson, Peter D. January 2005 (has links) (PDF)
Dissertation (Ph.D.)--Auburn University, 2005. / Abstract. Vita. Includes bibliographic references (p.104-114).
Graph theory. Linear programming.
139

The triangle intersection problem for hexagon triple systems

Pettis, Carl Stuart, 1979- Lindner, Charles C. January 2006 (has links) (PDF)
Dissertation (Ph.D.)--Auburn University, 2006. / Abstract. Vita. Includes bibliographic references (p.79).
Hexagons. Intersection graph theory.
140

Expected lengths of minimum spanning trees

Zhang, Xinyi. January 2008 (has links)
Thesis (Ph.D.)--University of Delaware, 2008. / Principal faculty advisor: Wenbo Li, Dept. of Mathematical Sciences. Includes bibliographical references.
Trees (Graph theory)

Page generated in 0.0541 seconds