Spelling suggestions: "subject:"hamiltonian graph"" "subject:"jamiltonian graph""
1 |
Cycles in graph theory and matroidsZhou, 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).
|
2 |
Hamiltonian line graphs and claw-free graphsYan, Huiya. January 1900 (has links)
Thesis (Ph. D.)--West Virginia University, 2009. / Title from document title page. Document formatted into pages; contains vi, 84 p. : ill. Includes abstract. Includes bibliographical references (p. 71-74).
|
3 |
Claw-free graphs and line graphsShao, Yehong, January 1900 (has links)
Thesis (Ph. D.)--West Virginia University, 2005. / Title from document title page. Document formatted into pages; contains vi, 49 p. : ill. Includes abstract. Includes bibliographical references (p. 47-49).
|
4 |
On the s-hamiltonian index of a graphShao, Yehong, January 1900 (has links)
Thesis (M.S.)--West Virginia University, 2005. / Title from document title page. Document formatted into pages; contains v, 17 p. : ill. Includes abstract. Includes bibliographical references (p. 17).
|
5 |
Eulerian subgraphs and Hamiltonicity of claw-free graphsZhan, Mingquan. January 2003 (has links)
Thesis (Ph. D.)--West Virginia University, 2003. / Title from document title page. Document formatted into pages; contains vi, 52 p. : ill. Includes abstract. Includes bibliographical references (p. 50-52).
|
6 |
Structural properties of visibility and weak visibility graphsDey, Sanjoy January 1997 (has links)
Given a finite set S of n nonintersecting line segments with no three end points collinear, the segment end point visibility graph is defined as the graph whose vertices are the end points of the line segments in S and two vertices are adjacent if the straight line segment joining two end points does not intersect any element of S, or if they are end points of the same segment. Segment end point visibility graphs have a wide variety of applications in VLSI circuit design, study of art gallery problems, and other areas of computational geometry. This thesis contains a survey of the important results that are currently known regarding the characterization of these graphs. Also a weak visibility dual of a segment end point visibility graph is defined and some structural properties of such graphs are presented. Some open problems and questions related to the characterization of weak visibility graphs are also discussed. / Department of Mathematical Sciences
|
7 |
Hamilton decompositions of graphs with primitive complementsOzkan, Sibel, January 2007 (has links) (PDF)
Thesis (Ph.D.)--Auburn University, 2007. / Abstract. Vita. Includes bibliographic references (ℓ.42-43)
|
8 |
On the additive graph generated by a subset of the natural numbersCostain, Gregory. January 1900 (has links)
Thesis (M.Sc.). / Written for the Dept. of Mathematics and Statistics. Title from title page of PDF (viewed 2008/04/12). Includes bibliographical references.
|
9 |
Snake cube puzzles Hamilton paths in grid graphs /McDonough, Alison Elizabeth. January 2009 (has links)
Honors Project--Smith College, Northampton, Mass., 2009. / Includes bibliographical references (p. 44).
|
10 |
Degree sum ensuring hamiltonicitySteelman, Andrea Elizabeth. January 2007 (has links)
Thesis (M.S.)--University of West Florida, 2007. / Title from title page of source document. Document formatted into pages; contains 68 pages. Includes bibliographical references.
|
Page generated in 0.0526 seconds