Advanced search options

Advanced Search Options 🞨

Browse by author name (“Author name starts with…”).

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

Sorted by: relevance · author · university · dateNew search

You searched for +publisher:"The Ohio State University" +contributor:("Robertson, Neil"). Showing records 1 – 6 of 6 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters

1. Sivaraman, Vaidyanathan. Some Topics concerning Graphs, Signed Graphs and Matroids.

Degree: PhD, Mathematics, 2012, The Ohio State University

 We discuss well-quasi-ordering in graphs and signed graphs, giving two short proofs of the bounded case of S. B. Rao's conjecture. We give a characterization… (more)

Subjects/Keywords: Mathematics; Graphs; Signed Graphs; Matroids; Heawood Graph; Projective-planar Graphs; Frustration; Zaslavsky's Conjecture; S. B. Rao's Conjecture; Welsh's Conjecture; WQO; Strongly Regular Graphs; Shrikhande's Theorem; Frame Matroid; Bicircular Matroid.

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Sivaraman, V. (2012). Some Topics concerning Graphs, Signed Graphs and Matroids. (Doctoral Dissertation). The Ohio State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=osu1354645035

Chicago Manual of Style (16th Edition):

Sivaraman, Vaidyanathan. “Some Topics concerning Graphs, Signed Graphs and Matroids.” 2012. Doctoral Dissertation, The Ohio State University. Accessed October 28, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=osu1354645035.

MLA Handbook (7th Edition):

Sivaraman, Vaidyanathan. “Some Topics concerning Graphs, Signed Graphs and Matroids.” 2012. Web. 28 Oct 2020.

Vancouver:

Sivaraman V. Some Topics concerning Graphs, Signed Graphs and Matroids. [Internet] [Doctoral dissertation]. The Ohio State University; 2012. [cited 2020 Oct 28]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1354645035.

Council of Science Editors:

Sivaraman V. Some Topics concerning Graphs, Signed Graphs and Matroids. [Doctoral Dissertation]. The Ohio State University; 2012. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1354645035

2. Maceli, Peter Lawson. Deciding st-connectivity in undirected graphs using logarithmic space.

Degree: MS, Mathematics, 2008, The Ohio State University

  In 2004 Omer Reingold gave a deterministic log-space algorithm which solves the problem of st-connectivity in undirected graphs. The motivating idea behind Reingold's algorithm… (more)

Subjects/Keywords: Mathematics; USTCON; log-space; expander graphs; graph connectivity

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Maceli, P. L. (2008). Deciding st-connectivity in undirected graphs using logarithmic space. (Masters Thesis). The Ohio State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=osu1211753530

Chicago Manual of Style (16th Edition):

Maceli, Peter Lawson. “Deciding st-connectivity in undirected graphs using logarithmic space.” 2008. Masters Thesis, The Ohio State University. Accessed October 28, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=osu1211753530.

MLA Handbook (7th Edition):

Maceli, Peter Lawson. “Deciding st-connectivity in undirected graphs using logarithmic space.” 2008. Web. 28 Oct 2020.

Vancouver:

Maceli PL. Deciding st-connectivity in undirected graphs using logarithmic space. [Internet] [Masters thesis]. The Ohio State University; 2008. [cited 2020 Oct 28]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1211753530.

Council of Science Editors:

Maceli PL. Deciding st-connectivity in undirected graphs using logarithmic space. [Masters Thesis]. The Ohio State University; 2008. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1211753530

3. Balachandran, Niranjan. The 3-Design Problem.

Degree: PhD, Mathematics, 2008, The Ohio State University

  This dissertation studies the ‘asymptotic existence’ conjecture for 3-designs with the primary goal of constructing new families of 3-designs. More specifically, this dissertation includes… (more)

Subjects/Keywords: Mathematics; 3-design; Candelabra system; projective special linear groups

…for the Degree Doctor of Philosophy in the Graduate School of the Ohio State University By… …Niranjan Balachandran, M. Stat(India) ***** The Ohio State University 2008… …Graduate Teaching Associate, The Ohio State University PUBLICATIONS 1. “Simple 3-designs and… 

Page 1 Page 2 Page 3 Page 4 Page 5

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Balachandran, N. (2008). The 3-Design Problem. (Doctoral Dissertation). The Ohio State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=osu1211922186

Chicago Manual of Style (16th Edition):

Balachandran, Niranjan. “The 3-Design Problem.” 2008. Doctoral Dissertation, The Ohio State University. Accessed October 28, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=osu1211922186.

MLA Handbook (7th Edition):

Balachandran, Niranjan. “The 3-Design Problem.” 2008. Web. 28 Oct 2020.

Vancouver:

Balachandran N. The 3-Design Problem. [Internet] [Doctoral dissertation]. The Ohio State University; 2008. [cited 2020 Oct 28]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1211922186.

Council of Science Editors:

Balachandran N. The 3-Design Problem. [Doctoral Dissertation]. The Ohio State University; 2008. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1211922186


The Ohio State University

4. Altomare, Christian J. Degree Sequences, Forcibly Chordal Graphs, and Combinatorial Proof Systems.

Degree: PhD, Mathematics, 2009, The Ohio State University

  We study the structure theory of two combinatorial objectsclosely related to graphs. First, we consider degree sequences, and we prove severalresults originally motivated by… (more)

Subjects/Keywords: Mathematics; degree sequence; forcibly; chordal; exclude; cycle; proof system; partial order; poset; forbidden minor; autonomous; ausys; lexicographic; proof; blocking; Rao's Conjecture; well quasi order; induced subgraph

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Altomare, C. J. (2009). Degree Sequences, Forcibly Chordal Graphs, and Combinatorial Proof Systems. (Doctoral Dissertation). The Ohio State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=osu1259546079

Chicago Manual of Style (16th Edition):

Altomare, Christian J. “Degree Sequences, Forcibly Chordal Graphs, and Combinatorial Proof Systems.” 2009. Doctoral Dissertation, The Ohio State University. Accessed October 28, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=osu1259546079.

MLA Handbook (7th Edition):

Altomare, Christian J. “Degree Sequences, Forcibly Chordal Graphs, and Combinatorial Proof Systems.” 2009. Web. 28 Oct 2020.

Vancouver:

Altomare CJ. Degree Sequences, Forcibly Chordal Graphs, and Combinatorial Proof Systems. [Internet] [Doctoral dissertation]. The Ohio State University; 2009. [cited 2020 Oct 28]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1259546079.

Council of Science Editors:

Altomare CJ. Degree Sequences, Forcibly Chordal Graphs, and Combinatorial Proof Systems. [Doctoral Dissertation]. The Ohio State University; 2009. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1259546079


The Ohio State University

5. Zhou, Xiangqian. Some Excluded-Minor Theorems for Binary Matroids.

Degree: PhD, Mathematics, 2003, The Ohio State University

  The purpose of this dissertation is to generalize some important excluded-minor theorems for graphs to binary matroids. Chapter 3 contains joint work with Hongxun… (more)

Subjects/Keywords: Mathematics; binary matroid; excluded-minor theorem; blocking sequence; internally 4-connected

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Zhou, X. (2003). Some Excluded-Minor Theorems for Binary Matroids. (Doctoral Dissertation). The Ohio State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=osu1070311692

Chicago Manual of Style (16th Edition):

Zhou, Xiangqian. “Some Excluded-Minor Theorems for Binary Matroids.” 2003. Doctoral Dissertation, The Ohio State University. Accessed October 28, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=osu1070311692.

MLA Handbook (7th Edition):

Zhou, Xiangqian. “Some Excluded-Minor Theorems for Binary Matroids.” 2003. Web. 28 Oct 2020.

Vancouver:

Zhou X. Some Excluded-Minor Theorems for Binary Matroids. [Internet] [Doctoral dissertation]. The Ohio State University; 2003. [cited 2020 Oct 28]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1070311692.

Council of Science Editors:

Zhou X. Some Excluded-Minor Theorems for Binary Matroids. [Doctoral Dissertation]. The Ohio State University; 2003. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1070311692


The Ohio State University

6. Micu, Eliade Mihai. Graph minors and Hadwiger's conjecture.

Degree: PhD, Mathematics, 2005, The Ohio State University

 One of the central open problems in Graph Theory is Hadwiger's Conjecture, which states that any graph with no clique minor of size k+1 is… (more)

Subjects/Keywords: Mathematics; Graph minors; Hadwiger's conjecture

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Micu, E. M. (2005). Graph minors and Hadwiger's conjecture. (Doctoral Dissertation). The Ohio State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=osu1123259686

Chicago Manual of Style (16th Edition):

Micu, Eliade Mihai. “Graph minors and Hadwiger's conjecture.” 2005. Doctoral Dissertation, The Ohio State University. Accessed October 28, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=osu1123259686.

MLA Handbook (7th Edition):

Micu, Eliade Mihai. “Graph minors and Hadwiger's conjecture.” 2005. Web. 28 Oct 2020.

Vancouver:

Micu EM. Graph minors and Hadwiger's conjecture. [Internet] [Doctoral dissertation]. The Ohio State University; 2005. [cited 2020 Oct 28]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1123259686.

Council of Science Editors:

Micu EM. Graph minors and Hadwiger's conjecture. [Doctoral Dissertation]. The Ohio State University; 2005. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1123259686

.