• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 753
  • 105
  • 69
  • 58
  • 24
  • 24
  • 16
  • 16
  • 16
  • 16
  • 16
  • 16
  • 14
  • 10
  • 7
  • Tagged with
  • 1385
  • 1385
  • 287
  • 196
  • 152
  • 148
  • 124
  • 122
  • 120
  • 119
  • 118
  • 115
  • 109
  • 107
  • 106
  • 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.
141

On extremal coin graphs, flowers, and their rational representations

Dunham, Jill Bigley. January 2009 (has links)
Thesis (Ph.D.)--George Mason University, 2009. / Vita: p. 103. Thesis director: Geir Agnarsson. Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Mathematics. Title from PDF t.p. (viewed Oct. 12, 2009). Includes bibliographical references (p. 101-102). Also issued in print.
142

Studies on graph-based coding systems

Sun, Jing. January 2004 (has links)
Thesis (Ph. D.)--Ohio State University, 2004. / Title from first page of PDF file. Document formatted into pages; contains xvi, 129 p.; also includes graphics. Includes bibliographical references (p. 126-129).
143

Intersection numbers of divisors in graph varieties

Jones, Deborah. Aluffi, Paolo. January 2003 (has links)
Thesis (Ph. D.)--Florida State University, 2003. / Advisor: Dr. Paolo Aluffi, Florida State University, College of Arts and Sciences, Dept. of Mathematics. Title and description from dissertation home page (viewed Sept. 08, 2004). Includes bibliographical references.
144

Constructing higher-order de Bruijn graphs /

Hunt, D'Hania J. January 2002 (has links) (PDF)
Thesis (M.S. in Applied Mathematics)--Naval Postgraduate School, June 2002. / Thesis advisor(s): Harold Fredricksen, Craig W. Rasmussen. Includes bibliographical references (p. 45-46). Also available online.
145

Approximating the circumference of 3-connected claw-free graphs

Bilinski, Mark. January 2008 (has links)
Thesis (Ph.D)--Mathematics, Georgia Institute of Technology, 2009. / Committee Chair: Yu, Xingxing; Committee Member: Duke, Richard; Committee Member: Tetali, Prasad; Committee Member: Thomas, Robin; Committee Member: Vigoda, Eric. Part of the SMARTech Electronic Thesis and Dissertation Collection.
146

Continuous subgraph pattern search over graph streams /

Wang, Changliang. January 2009 (has links)
Thesis (M.Phil.)--Hong Kong University of Science and Technology, 2009. / Includes bibliographical references (p. 62-65).
147

A comparison of auditory and visual graphs for use in physics and mathematics /

Sahyun, Steven Carl. January 1900 (has links)
Thesis (Ph. D.)--Oregon State University, 2000. / Typescript (photocopy). Includes bibliographical references (leaves 141-148). Also available via the World Wide Web.
148

Coloring clique hypergraphs

Poon, Hoifung. January 2000 (has links)
Thesis (M.S.)--West Virginia University, 2000. / Title from document title page. Document formatted into pages; contains iii, 34 p. Includes abstract. Includes bibliographical references (p. 33-34).
149

The relationship between the minimal rank of a tree and the rank-spreads of the vertices and edges /

Sinkovic, John Henry, January 2006 (has links) (PDF)
Thesis (M.S.)--Brigham Young University. Dept. of Mathematics, 2006. / Includes bibliographical references (p. 48).
150

Min-max theorems on feedback vertex sets

Li, Yin-chiu. January 2002 (has links)
Thesis (M.Phil.)--University of Hong Kong, 2003. / Includes bibliographical references (leaves 48-49) Also available in print.

Page generated in 0.0579 seconds