Advanced search options

Sorted by: relevance · author · university · date | New search

You searched for `subject:(Graph theory )`

.
Showing records 1 – 30 of
1561 total matches.

◁ [1] [2] [3] [4] [5] … [53] ▶

Search Limiters

Dates

- 2015 – 2019 (542)
- 2010 – 2014 (547)
- 2005 – 2009 (251)
- 2000 – 2004 (102)
- 1995 – 1999 (56)
- 1990 – 1994 (56)
- 1985 – 1989 (47)
- 1980 – 1984 (27)
- 1975 – 1979 (20)
- 1970 – 1974 (19)

Universities

- ETH Zürich (96)
- Simon Fraser University (60)
- University of Waterloo (58)
- Georgia Tech (49)
- Brno University of Technology (41)
- University of Victoria (40)
- East Tennessee State University (39)
- Michigan State University (26)
- University of Illinois – Urbana-Champaign (26)
- Hong Kong University of Science and Technology (24)
- University of Johannesburg (24)
- The Ohio State University (23)
- University of Florida (21)
- Indian Institute of Science (20)
- Virginia Commonwealth University (18)

Department

- Mathematics (127)
- Mathematical Sciences (63)
- Computer Science (44)
- Informatique (38)
- Department of Mathematics (20)
- Department of Computer Science (15)
- Electrical and Computer Engineering (14)
- Graduate School (14)
- Mathematics and Statistics (14)
- Department of Mathematics and Statistics (12)
- Dept. of Mathematics and Statistics (12)
- Electrical Engineering (10)
- Engineering (10)
- School of Computer Science. (10)

Degrees

- PhD (348)
- MS (163)
- Docteur es (97)
- MAin Mathematics (13)
- MA (12)

Levels

- doctoral (616)
- masters (246)
- thesis (43)
- doctor of philosophy ph.d. (16)

Languages

- English (1014)
- French (48)
- Czech (36)
- Portuguese (34)
- Greek (21)

Country

- US (610)
- Canada (246)
- Switzerland (100)
- France (97)
- UK (55)
- India (54)
- South Africa (53)
- Czech Republic (41)
- Australia (40)
- Hong Kong (38)
- Netherlands (38)
- Brazil (35)
- Greece (33)
- Spain (23)
- New Zealand (15)

▼ Search Limiters

University of Johannesburg

1.
Desormeaux, Wyatt Jules.
Total domination in graphs and *graph* modifications.

Degree: PhD, 2012, University of Johannesburg

URL: http://hdl.handle.net/10210/6158

► In this thesis, our primary objective is to investigate the effects that various *graph* modifications have on the total domination number of a *graph*. In…
(more)

Subjects/Keywords: Graph theory; Domination (Graph theory)

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Desormeaux, W. J. (2012). Total domination in graphs and graph modifications. (Doctoral Dissertation). University of Johannesburg. Retrieved from http://hdl.handle.net/10210/6158

Chicago Manual of Style (16^{th} Edition):

Desormeaux, Wyatt Jules. “Total domination in graphs and graph modifications.” 2012. Doctoral Dissertation, University of Johannesburg. Accessed September 16, 2019. http://hdl.handle.net/10210/6158.

MLA Handbook (7^{th} Edition):

Desormeaux, Wyatt Jules. “Total domination in graphs and graph modifications.” 2012. Web. 16 Sep 2019.

Vancouver:

Desormeaux WJ. Total domination in graphs and graph modifications. [Internet] [Doctoral dissertation]. University of Johannesburg; 2012. [cited 2019 Sep 16]. Available from: http://hdl.handle.net/10210/6158.

Council of Science Editors:

Desormeaux WJ. Total domination in graphs and graph modifications. [Doctoral Dissertation]. University of Johannesburg; 2012. Available from: http://hdl.handle.net/10210/6158

University of Victoria

2.
Gelling, Eric Neil.
On 1-factorizations of the complete *graph* and the relationship to round robin schedules.

Degree: Department of Mathematics and Statistics, 2016, University of Victoria

URL: http://hdl.handle.net/1828/7341

► The following new results concerning 1-factorizations of the complete *graph* are proved: (1) There are exactly 6 equivalence classes of 1-factorizations of the complete *graph*…
(more)

Subjects/Keywords: graph theory

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Gelling, E. N. (2016). On 1-factorizations of the complete graph and the relationship to round robin schedules. (Masters Thesis). University of Victoria. Retrieved from http://hdl.handle.net/1828/7341

Chicago Manual of Style (16^{th} Edition):

Gelling, Eric Neil. “On 1-factorizations of the complete graph and the relationship to round robin schedules.” 2016. Masters Thesis, University of Victoria. Accessed September 16, 2019. http://hdl.handle.net/1828/7341.

MLA Handbook (7^{th} Edition):

Gelling, Eric Neil. “On 1-factorizations of the complete graph and the relationship to round robin schedules.” 2016. Web. 16 Sep 2019.

Vancouver:

Gelling EN. On 1-factorizations of the complete graph and the relationship to round robin schedules. [Internet] [Masters thesis]. University of Victoria; 2016. [cited 2019 Sep 16]. Available from: http://hdl.handle.net/1828/7341.

Council of Science Editors:

Gelling EN. On 1-factorizations of the complete graph and the relationship to round robin schedules. [Masters Thesis]. University of Victoria; 2016. Available from: http://hdl.handle.net/1828/7341

Princeton University

3. Gauthier, Gregory Joseph. The structure of graphs with no cycles of length 0 (mod 3) .

Degree: PhD, 2017, Princeton University

URL: http://arks.princeton.edu/ark:/88435/dsp010r9676355

► We examine the structure of graphs that have no cycles of length 0 (mod 3). We show that, if G is a simple 2-connected *graph*…
(more)

Subjects/Keywords: graph; structural graph theory; swamp

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Gauthier, G. J. (2017). The structure of graphs with no cycles of length 0 (mod 3) . (Doctoral Dissertation). Princeton University. Retrieved from http://arks.princeton.edu/ark:/88435/dsp010r9676355

Chicago Manual of Style (16^{th} Edition):

Gauthier, Gregory Joseph. “The structure of graphs with no cycles of length 0 (mod 3) .” 2017. Doctoral Dissertation, Princeton University. Accessed September 16, 2019. http://arks.princeton.edu/ark:/88435/dsp010r9676355.

MLA Handbook (7^{th} Edition):

Gauthier, Gregory Joseph. “The structure of graphs with no cycles of length 0 (mod 3) .” 2017. Web. 16 Sep 2019.

Vancouver:

Gauthier GJ. The structure of graphs with no cycles of length 0 (mod 3) . [Internet] [Doctoral dissertation]. Princeton University; 2017. [cited 2019 Sep 16]. Available from: http://arks.princeton.edu/ark:/88435/dsp010r9676355.

Council of Science Editors:

Gauthier GJ. The structure of graphs with no cycles of length 0 (mod 3) . [Doctoral Dissertation]. Princeton University; 2017. Available from: http://arks.princeton.edu/ark:/88435/dsp010r9676355

University of Waterloo

4. Sullivan, Matthew. Planar graphs without 3-cycles and with 4-cycles far apart are 3-choosable.

Degree: 2016, University of Waterloo

URL: http://hdl.handle.net/10012/10859

► A *graph* G is said to be L-colourable if for a given list assignment L = {L(v)|v ∈ V (G)} there is a proper colouring…
(more)

Subjects/Keywords: Graph Theory; Graph Colouring

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Sullivan, M. (2016). Planar graphs without 3-cycles and with 4-cycles far apart are 3-choosable. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/10859

Note: this citation may be lacking information needed for this citation format:

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Sullivan, Matthew. “Planar graphs without 3-cycles and with 4-cycles far apart are 3-choosable.” 2016. Thesis, University of Waterloo. Accessed September 16, 2019. http://hdl.handle.net/10012/10859.

Note: this citation may be lacking information needed for this citation format:

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Sullivan, Matthew. “Planar graphs without 3-cycles and with 4-cycles far apart are 3-choosable.” 2016. Web. 16 Sep 2019.

Vancouver:

Sullivan M. Planar graphs without 3-cycles and with 4-cycles far apart are 3-choosable. [Internet] [Thesis]. University of Waterloo; 2016. [cited 2019 Sep 16]. Available from: http://hdl.handle.net/10012/10859.

Note: this citation may be lacking information needed for this citation format:

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Sullivan M. Planar graphs without 3-cycles and with 4-cycles far apart are 3-choosable. [Thesis]. University of Waterloo; 2016. Available from: http://hdl.handle.net/10012/10859

Not specified: Masters Thesis or Doctoral Dissertation

Vanderbilt University

5. Solava, Ryan William. On the fine structure of graphs avoiding certain complete bipartite minors.

Degree: PhD, Mathematics, 2019, Vanderbilt University

URL: http://etd.library.vanderbilt.edu/available/etd-08182019-190904/ ;

► Avoiding complete bipartite graphs as minors, and in particular K_{2,t} as a minor, has been used to give sufficient conditions for Hamiltonicity. For this reason…
(more)

Subjects/Keywords: Graph theory; Graph minors

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Solava, R. W. (2019). On the fine structure of graphs avoiding certain complete bipartite minors. (Doctoral Dissertation). Vanderbilt University. Retrieved from http://etd.library.vanderbilt.edu/available/etd-08182019-190904/ ;

Chicago Manual of Style (16^{th} Edition):

Solava, Ryan William. “On the fine structure of graphs avoiding certain complete bipartite minors.” 2019. Doctoral Dissertation, Vanderbilt University. Accessed September 16, 2019. http://etd.library.vanderbilt.edu/available/etd-08182019-190904/ ;.

MLA Handbook (7^{th} Edition):

Solava, Ryan William. “On the fine structure of graphs avoiding certain complete bipartite minors.” 2019. Web. 16 Sep 2019.

Vancouver:

Solava RW. On the fine structure of graphs avoiding certain complete bipartite minors. [Internet] [Doctoral dissertation]. Vanderbilt University; 2019. [cited 2019 Sep 16]. Available from: http://etd.library.vanderbilt.edu/available/etd-08182019-190904/ ;.

Council of Science Editors:

Solava RW. On the fine structure of graphs avoiding certain complete bipartite minors. [Doctoral Dissertation]. Vanderbilt University; 2019. Available from: http://etd.library.vanderbilt.edu/available/etd-08182019-190904/ ;

Louisiana State University

6. Fallon, Joshua E. Two Results in Drawing Graphs on Surfaces.

Degree: PhD, Discrete Mathematics and Combinatorics, 2018, Louisiana State University

URL: https://digitalcommons.lsu.edu/gradschool_dissertations/4611

► In this work we present results on crossing-critical graphs drawn on non-planar surfaces and results on edge-hamiltonicity of graphs on the Klein bottle. We…
(more)

Subjects/Keywords: graph theory; combinatorics; topological graph theory

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Fallon, J. E. (2018). Two Results in Drawing Graphs on Surfaces. (Doctoral Dissertation). Louisiana State University. Retrieved from https://digitalcommons.lsu.edu/gradschool_dissertations/4611

Chicago Manual of Style (16^{th} Edition):

Fallon, Joshua E. “Two Results in Drawing Graphs on Surfaces.” 2018. Doctoral Dissertation, Louisiana State University. Accessed September 16, 2019. https://digitalcommons.lsu.edu/gradschool_dissertations/4611.

MLA Handbook (7^{th} Edition):

Fallon, Joshua E. “Two Results in Drawing Graphs on Surfaces.” 2018. Web. 16 Sep 2019.

Vancouver:

Fallon JE. Two Results in Drawing Graphs on Surfaces. [Internet] [Doctoral dissertation]. Louisiana State University; 2018. [cited 2019 Sep 16]. Available from: https://digitalcommons.lsu.edu/gradschool_dissertations/4611.

Council of Science Editors:

Fallon JE. Two Results in Drawing Graphs on Surfaces. [Doctoral Dissertation]. Louisiana State University; 2018. Available from: https://digitalcommons.lsu.edu/gradschool_dissertations/4611

University of Victoria

7. Manzer, Joshua Daniel Adrian. Chronological rectangle digraphs.

Degree: Department of Mathematics and Statistics, 2015, University of Victoria

URL: http://hdl.handle.net/1828/6989

► Interval graphs admit elegant ordering and structural characterizations. A natural digraph analogue of interval graphs, called chronological interval digraphs, has recently been identified and studied.…
(more)

Subjects/Keywords: Mathematics; Combinatorics; Graph Theory; Structural Graph Theory

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Manzer, J. D. A. (2015). Chronological rectangle digraphs. (Thesis). University of Victoria. Retrieved from http://hdl.handle.net/1828/6989

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Manzer, Joshua Daniel Adrian. “Chronological rectangle digraphs.” 2015. Thesis, University of Victoria. Accessed September 16, 2019. http://hdl.handle.net/1828/6989.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Manzer, Joshua Daniel Adrian. “Chronological rectangle digraphs.” 2015. Web. 16 Sep 2019.

Vancouver:

Manzer JDA. Chronological rectangle digraphs. [Internet] [Thesis]. University of Victoria; 2015. [cited 2019 Sep 16]. Available from: http://hdl.handle.net/1828/6989.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Manzer JDA. Chronological rectangle digraphs. [Thesis]. University of Victoria; 2015. Available from: http://hdl.handle.net/1828/6989

Not specified: Masters Thesis or Doctoral Dissertation

University of Melbourne

8. Rotheram, Ricky. Cores of vertex-transitive graphs.

Degree: 2013, University of Melbourne

URL: http://hdl.handle.net/11343/39734

► The core of a *graph* Γ is the smallest *graph* Γ^\ast for which there exist *graph* homomorphisms Γ → Γ^\ast and Γ^\ast → Γ. Thus cores are fundamental to…
(more)

Subjects/Keywords: repository; mathematics; graph theory; algebraic graph theory

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Rotheram, R. (2013). Cores of vertex-transitive graphs. (Masters Thesis). University of Melbourne. Retrieved from http://hdl.handle.net/11343/39734

Chicago Manual of Style (16^{th} Edition):

Rotheram, Ricky. “Cores of vertex-transitive graphs.” 2013. Masters Thesis, University of Melbourne. Accessed September 16, 2019. http://hdl.handle.net/11343/39734.

MLA Handbook (7^{th} Edition):

Rotheram, Ricky. “Cores of vertex-transitive graphs.” 2013. Web. 16 Sep 2019.

Vancouver:

Rotheram R. Cores of vertex-transitive graphs. [Internet] [Masters thesis]. University of Melbourne; 2013. [cited 2019 Sep 16]. Available from: http://hdl.handle.net/11343/39734.

Council of Science Editors:

Rotheram R. Cores of vertex-transitive graphs. [Masters Thesis]. University of Melbourne; 2013. Available from: http://hdl.handle.net/11343/39734

Dalhousie University

9.
Cameron, Ben.
P-Generating Polynomials and the P-Fractal of a
* Graph*.

Degree: MS, Department of Mathematics & Statistics - Math Division, 2014, Dalhousie University

URL: http://hdl.handle.net/10222/53946

► We define the P -generating polynomial for a *graph* G and property P as the generating polynomial for the number of P-subgraphs of G of…
(more)

Subjects/Keywords: Graph theory; Polynomials

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Cameron, B. (2014). P-Generating Polynomials and the P-Fractal of a Graph. (Masters Thesis). Dalhousie University. Retrieved from http://hdl.handle.net/10222/53946

Chicago Manual of Style (16^{th} Edition):

Cameron, Ben. “P-Generating Polynomials and the P-Fractal of a Graph.” 2014. Masters Thesis, Dalhousie University. Accessed September 16, 2019. http://hdl.handle.net/10222/53946.

MLA Handbook (7^{th} Edition):

Cameron, Ben. “P-Generating Polynomials and the P-Fractal of a Graph.” 2014. Web. 16 Sep 2019.

Vancouver:

Cameron B. P-Generating Polynomials and the P-Fractal of a Graph. [Internet] [Masters thesis]. Dalhousie University; 2014. [cited 2019 Sep 16]. Available from: http://hdl.handle.net/10222/53946.

Council of Science Editors:

Cameron B. P-Generating Polynomials and the P-Fractal of a Graph. [Masters Thesis]. Dalhousie University; 2014. Available from: http://hdl.handle.net/10222/53946

University of KwaZulu-Natal

10. [No author]. Aspects of distance measures in graphs.

Degree: Mathematics, 2011, University of KwaZulu-Natal

URL: http://hdl.handle.net/10413/9841

► In this thesis we investigate bounds on distance measures, namely, Steiner diameter and radius, in terms of other *graph* parameters. The thesis consists of four…
(more)

Subjects/Keywords: Graph theory.; Mathematics.

Record Details Similar Records

❌

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

APA (6^{th} Edition):

author], [. (2011). Aspects of distance measures in graphs. (Thesis). University of KwaZulu-Natal. Retrieved from http://hdl.handle.net/10413/9841

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

author], [No. “Aspects of distance measures in graphs. ” 2011. Thesis, University of KwaZulu-Natal. Accessed September 16, 2019. http://hdl.handle.net/10413/9841.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

author], [No. “Aspects of distance measures in graphs. ” 2011. Web. 16 Sep 2019.

Vancouver:

author] [. Aspects of distance measures in graphs. [Internet] [Thesis]. University of KwaZulu-Natal; 2011. [cited 2019 Sep 16]. Available from: http://hdl.handle.net/10413/9841.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

author] [. Aspects of distance measures in graphs. [Thesis]. University of KwaZulu-Natal; 2011. Available from: http://hdl.handle.net/10413/9841

Not specified: Masters Thesis or Doctoral Dissertation

University of Victoria

11.
Boyer, John M.
Simplified O(n) algorithms for planar *graph* embedding, Kuratowski subgraph isolation, and related problems.

Degree: Department of Computer Science, 2018, University of Victoria

URL: https://dspace.library.uvic.ca//handle/1828/9918

► A *graph* is planar if it can be drawn on the plane with vertices at unique locations and no edge intersections. Due to the wealth…
(more)

Subjects/Keywords: Graph theory; Algorithms

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Boyer, J. M. (2018). Simplified O(n) algorithms for planar graph embedding, Kuratowski subgraph isolation, and related problems. (Thesis). University of Victoria. Retrieved from https://dspace.library.uvic.ca//handle/1828/9918

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Boyer, John M. “Simplified O(n) algorithms for planar graph embedding, Kuratowski subgraph isolation, and related problems.” 2018. Thesis, University of Victoria. Accessed September 16, 2019. https://dspace.library.uvic.ca//handle/1828/9918.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Boyer, John M. “Simplified O(n) algorithms for planar graph embedding, Kuratowski subgraph isolation, and related problems.” 2018. Web. 16 Sep 2019.

Vancouver:

Boyer JM. Simplified O(n) algorithms for planar graph embedding, Kuratowski subgraph isolation, and related problems. [Internet] [Thesis]. University of Victoria; 2018. [cited 2019 Sep 16]. Available from: https://dspace.library.uvic.ca//handle/1828/9918.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Boyer JM. Simplified O(n) algorithms for planar graph embedding, Kuratowski subgraph isolation, and related problems. [Thesis]. University of Victoria; 2018. Available from: https://dspace.library.uvic.ca//handle/1828/9918

Not specified: Masters Thesis or Doctoral Dissertation

12. Acampa, Stephen. Results on the Gold Grabbing Game.

Degree: MS, Mathematics and Statistics, 2018, Eastern Kentucky U

URL: https://encompass.eku.edu/etd/500

► In this paper, we will contribute to research on a *Graph* *Theory* problem known as the Gold Grabbing Game. The game consists of two…
(more)

Subjects/Keywords: Graph Theory; Mathematics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Acampa, S. (2018). Results on the Gold Grabbing Game. (Masters Thesis). Eastern Kentucky U. Retrieved from https://encompass.eku.edu/etd/500

Chicago Manual of Style (16^{th} Edition):

Acampa, Stephen. “Results on the Gold Grabbing Game.” 2018. Masters Thesis, Eastern Kentucky U. Accessed September 16, 2019. https://encompass.eku.edu/etd/500.

MLA Handbook (7^{th} Edition):

Acampa, Stephen. “Results on the Gold Grabbing Game.” 2018. Web. 16 Sep 2019.

Vancouver:

Acampa S. Results on the Gold Grabbing Game. [Internet] [Masters thesis]. Eastern Kentucky U; 2018. [cited 2019 Sep 16]. Available from: https://encompass.eku.edu/etd/500.

Council of Science Editors:

Acampa S. Results on the Gold Grabbing Game. [Masters Thesis]. Eastern Kentucky U; 2018. Available from: https://encompass.eku.edu/etd/500

Utah State University

13.
Andersen, Aaron.
GraphShop: An Interactive Software Environment for *Graph* *Theory* Research and Applications.

Degree: MS, Mathematics and Statistics, 2011, Utah State University

URL: https://digitalcommons.usu.edu/etd/896

► *Graph* *Theory* is the mathematical study of the structure of abstract relationships between objects. Although these constructions (graphs) are themselves purely theoretical, their ability…
(more)

Subjects/Keywords: Graph Theory; Mathematics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Andersen, A. (2011). GraphShop: An Interactive Software Environment for Graph Theory Research and Applications. (Masters Thesis). Utah State University. Retrieved from https://digitalcommons.usu.edu/etd/896

Chicago Manual of Style (16^{th} Edition):

Andersen, Aaron. “GraphShop: An Interactive Software Environment for Graph Theory Research and Applications.” 2011. Masters Thesis, Utah State University. Accessed September 16, 2019. https://digitalcommons.usu.edu/etd/896.

MLA Handbook (7^{th} Edition):

Andersen, Aaron. “GraphShop: An Interactive Software Environment for Graph Theory Research and Applications.” 2011. Web. 16 Sep 2019.

Vancouver:

Andersen A. GraphShop: An Interactive Software Environment for Graph Theory Research and Applications. [Internet] [Masters thesis]. Utah State University; 2011. [cited 2019 Sep 16]. Available from: https://digitalcommons.usu.edu/etd/896.

Council of Science Editors:

Andersen A. GraphShop: An Interactive Software Environment for Graph Theory Research and Applications. [Masters Thesis]. Utah State University; 2011. Available from: https://digitalcommons.usu.edu/etd/896

University of Manitoba

14. Arman, Andrii. Maximum number of cycles in graphs and multigraphs.

Degree: Mathematics, 2016, University of Manitoba

URL: http://hdl.handle.net/1993/33030

► In this thesis a problem of determining the maximum number of cycles for the following classes of graphs is considered: triangle-free graphs; K_r-free graphs; graphs…
(more)

Subjects/Keywords: Graph Theory; Cycles

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Arman, A. (2016). Maximum number of cycles in graphs and multigraphs. (Thesis). University of Manitoba. Retrieved from http://hdl.handle.net/1993/33030

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Arman, Andrii. “Maximum number of cycles in graphs and multigraphs.” 2016. Thesis, University of Manitoba. Accessed September 16, 2019. http://hdl.handle.net/1993/33030.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Arman, Andrii. “Maximum number of cycles in graphs and multigraphs.” 2016. Web. 16 Sep 2019.

Vancouver:

Arman A. Maximum number of cycles in graphs and multigraphs. [Internet] [Thesis]. University of Manitoba; 2016. [cited 2019 Sep 16]. Available from: http://hdl.handle.net/1993/33030.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Arman A. Maximum number of cycles in graphs and multigraphs. [Thesis]. University of Manitoba; 2016. Available from: http://hdl.handle.net/1993/33030

Not specified: Masters Thesis or Doctoral Dissertation

Rutgers University

15. Khan, Imdadullah, 1980-. Spanning subgraphs in graphs and hypergraphs.

Degree: PhD, Computer Science, 2011, Rutgers University

URL: http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000061299

►

This thesis consists of three new fundamental results on the existence of spanning subgraphs in graphs and hypergraphs. Cycle Factors in Graphs: A classical conjecture… (more)

Subjects/Keywords: Graph theory; Hypergraphs

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Khan, Imdadullah, 1. (2011). Spanning subgraphs in graphs and hypergraphs. (Doctoral Dissertation). Rutgers University. Retrieved from http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000061299

Chicago Manual of Style (16^{th} Edition):

Khan, Imdadullah, 1980-. “Spanning subgraphs in graphs and hypergraphs.” 2011. Doctoral Dissertation, Rutgers University. Accessed September 16, 2019. http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000061299.

MLA Handbook (7^{th} Edition):

Khan, Imdadullah, 1980-. “Spanning subgraphs in graphs and hypergraphs.” 2011. Web. 16 Sep 2019.

Vancouver:

Khan, Imdadullah 1. Spanning subgraphs in graphs and hypergraphs. [Internet] [Doctoral dissertation]. Rutgers University; 2011. [cited 2019 Sep 16]. Available from: http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000061299.

Council of Science Editors:

Khan, Imdadullah 1. Spanning subgraphs in graphs and hypergraphs. [Doctoral Dissertation]. Rutgers University; 2011. Available from: http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000061299

Rutgers University

16. Wang, Pei, 1987-. Relative Rips machine and thin type components of band complexes.

Degree: PhD, Mathematical Sciences, 2016, Rutgers University

URL: https://rucore.libraries.rutgers.edu/rutgers-lib/50574/

►

The Rips machine is a method of studying the action of groups on real trees. Roughly speaking, the Rips machine is an algorithm that takes… (more)

Subjects/Keywords: Trees (Graph theory)

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Wang, Pei, 1. (2016). Relative Rips machine and thin type components of band complexes. (Doctoral Dissertation). Rutgers University. Retrieved from https://rucore.libraries.rutgers.edu/rutgers-lib/50574/

Chicago Manual of Style (16^{th} Edition):

Wang, Pei, 1987-. “Relative Rips machine and thin type components of band complexes.” 2016. Doctoral Dissertation, Rutgers University. Accessed September 16, 2019. https://rucore.libraries.rutgers.edu/rutgers-lib/50574/.

MLA Handbook (7^{th} Edition):

Wang, Pei, 1987-. “Relative Rips machine and thin type components of band complexes.” 2016. Web. 16 Sep 2019.

Vancouver:

Wang, Pei 1. Relative Rips machine and thin type components of band complexes. [Internet] [Doctoral dissertation]. Rutgers University; 2016. [cited 2019 Sep 16]. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/50574/.

Council of Science Editors:

Wang, Pei 1. Relative Rips machine and thin type components of band complexes. [Doctoral Dissertation]. Rutgers University; 2016. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/50574/

Colorado State University

17. Chaturvedi, Mmanu. Parametric classification of directed acyclic graphs, A.

Degree: MS(M.S.), Computer Science, 2017, Colorado State University

URL: http://hdl.handle.net/10217/183921

► We consider four NP-hard optimization problems on directed acyclic graphs (DAGs), namely, max clique, min coloring, max independent set and min clique cover. It is…
(more)

Subjects/Keywords: Graph Theory; Algorithms

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Chaturvedi, M. (2017). Parametric classification of directed acyclic graphs, A. (Masters Thesis). Colorado State University. Retrieved from http://hdl.handle.net/10217/183921

Chicago Manual of Style (16^{th} Edition):

Chaturvedi, Mmanu. “Parametric classification of directed acyclic graphs, A.” 2017. Masters Thesis, Colorado State University. Accessed September 16, 2019. http://hdl.handle.net/10217/183921.

MLA Handbook (7^{th} Edition):

Chaturvedi, Mmanu. “Parametric classification of directed acyclic graphs, A.” 2017. Web. 16 Sep 2019.

Vancouver:

Chaturvedi M. Parametric classification of directed acyclic graphs, A. [Internet] [Masters thesis]. Colorado State University; 2017. [cited 2019 Sep 16]. Available from: http://hdl.handle.net/10217/183921.

Council of Science Editors:

Chaturvedi M. Parametric classification of directed acyclic graphs, A. [Masters Thesis]. Colorado State University; 2017. Available from: http://hdl.handle.net/10217/183921

Virginia Tech

18.
Dickson, James Odziemiec.
An Introduction to Ramsey *Theory* on Graphs.

Degree: MS, Mathematics, 2011, Virginia Tech

URL: http://hdl.handle.net/10919/32873

This thesis is written as a single source introduction to Ramsey Theory for advanced undergraduates and graduate students.
*Advisors/Committee Members: Brown, Ezra A. (committeechair), Klaus, Martin (committee member), Loehr, Nicholas A. (committee member), Shimozono, Mark M. (committee member).*

Subjects/Keywords: Combinatorics; Graph Theory; Ramsey Theory

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Dickson, J. O. (2011). An Introduction to Ramsey Theory on Graphs. (Masters Thesis). Virginia Tech. Retrieved from http://hdl.handle.net/10919/32873

Chicago Manual of Style (16^{th} Edition):

Dickson, James Odziemiec. “An Introduction to Ramsey Theory on Graphs.” 2011. Masters Thesis, Virginia Tech. Accessed September 16, 2019. http://hdl.handle.net/10919/32873.

MLA Handbook (7^{th} Edition):

Dickson, James Odziemiec. “An Introduction to Ramsey Theory on Graphs.” 2011. Web. 16 Sep 2019.

Vancouver:

Dickson JO. An Introduction to Ramsey Theory on Graphs. [Internet] [Masters thesis]. Virginia Tech; 2011. [cited 2019 Sep 16]. Available from: http://hdl.handle.net/10919/32873.

Council of Science Editors:

Dickson JO. An Introduction to Ramsey Theory on Graphs. [Masters Thesis]. Virginia Tech; 2011. Available from: http://hdl.handle.net/10919/32873

University of Johannesburg

19.
Berger, Amelie Julie.
Minimal reducible bounds, forbidden subgraphs and prime ideals in the lattice of additive hereditary *graph* properties.

Degree: PhD, 2012, University of Johannesburg

URL: http://hdl.handle.net/10210/4277

► After giving basic definitions concerning additive hereditary properties of graphs, this document is divided into three main sections, concerning minimal reducible bounds, minimal forbidden subgraphs…
(more)

Subjects/Keywords: Graph theory; Lattice theory

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Berger, A. J. (2012). Minimal reducible bounds, forbidden subgraphs and prime ideals in the lattice of additive hereditary graph properties. (Doctoral Dissertation). University of Johannesburg. Retrieved from http://hdl.handle.net/10210/4277

Chicago Manual of Style (16^{th} Edition):

Berger, Amelie Julie. “Minimal reducible bounds, forbidden subgraphs and prime ideals in the lattice of additive hereditary graph properties.” 2012. Doctoral Dissertation, University of Johannesburg. Accessed September 16, 2019. http://hdl.handle.net/10210/4277.

MLA Handbook (7^{th} Edition):

Berger, Amelie Julie. “Minimal reducible bounds, forbidden subgraphs and prime ideals in the lattice of additive hereditary graph properties.” 2012. Web. 16 Sep 2019.

Vancouver:

Berger AJ. Minimal reducible bounds, forbidden subgraphs and prime ideals in the lattice of additive hereditary graph properties. [Internet] [Doctoral dissertation]. University of Johannesburg; 2012. [cited 2019 Sep 16]. Available from: http://hdl.handle.net/10210/4277.

Council of Science Editors:

Berger AJ. Minimal reducible bounds, forbidden subgraphs and prime ideals in the lattice of additive hereditary graph properties. [Doctoral Dissertation]. University of Johannesburg; 2012. Available from: http://hdl.handle.net/10210/4277

Louisiana State University

20. D'souza, Kimberly Sevin. Excluding a Weakly 4-connected Minor.

Degree: PhD, Applied Mathematics, 2016, Louisiana State University

URL: etd-04042016-220803 ; https://digitalcommons.lsu.edu/gradschool_dissertations/1368

► A 3-connected *graph* G is called weakly 4-connected if min (|E(G_{1})|, |E(G_{2})|) ≤ 4 holds for all 3-separations (G_{1},G_{2}) of G. A 3-connected *graph* G…
(more)

Subjects/Keywords: graph theory; graph minors; graph decomposition; Pyramid graph

Record Details Similar Records

❌

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

APA (6^{th} Edition):

D'souza, K. S. (2016). Excluding a Weakly 4-connected Minor. (Doctoral Dissertation). Louisiana State University. Retrieved from etd-04042016-220803 ; https://digitalcommons.lsu.edu/gradschool_dissertations/1368

Chicago Manual of Style (16^{th} Edition):

D'souza, Kimberly Sevin. “Excluding a Weakly 4-connected Minor.” 2016. Doctoral Dissertation, Louisiana State University. Accessed September 16, 2019. etd-04042016-220803 ; https://digitalcommons.lsu.edu/gradschool_dissertations/1368.

MLA Handbook (7^{th} Edition):

D'souza, Kimberly Sevin. “Excluding a Weakly 4-connected Minor.” 2016. Web. 16 Sep 2019.

Vancouver:

D'souza KS. Excluding a Weakly 4-connected Minor. [Internet] [Doctoral dissertation]. Louisiana State University; 2016. [cited 2019 Sep 16]. Available from: etd-04042016-220803 ; https://digitalcommons.lsu.edu/gradschool_dissertations/1368.

Council of Science Editors:

D'souza KS. Excluding a Weakly 4-connected Minor. [Doctoral Dissertation]. Louisiana State University; 2016. Available from: etd-04042016-220803 ; https://digitalcommons.lsu.edu/gradschool_dissertations/1368

University of Waterloo

21. Arroyo Guevara, Alan Marcelo. On Geometric Drawings of Graphs.

Degree: 2018, University of Waterloo

URL: http://hdl.handle.net/10012/13103

► This thesis is about geometric drawings of graphs and their topological generalizations. First, we study pseudolinear drawings of graphs in the plane. A pseudolinear drawing…
(more)

Subjects/Keywords: combinatorics; crossing numbers; graph theory; graph; drawing; complete graph; rectilinear; graph embedding; graph drawing

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Arroyo Guevara, A. M. (2018). On Geometric Drawings of Graphs. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/13103

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Arroyo Guevara, Alan Marcelo. “On Geometric Drawings of Graphs.” 2018. Thesis, University of Waterloo. Accessed September 16, 2019. http://hdl.handle.net/10012/13103.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Arroyo Guevara, Alan Marcelo. “On Geometric Drawings of Graphs.” 2018. Web. 16 Sep 2019.

Vancouver:

Arroyo Guevara AM. On Geometric Drawings of Graphs. [Internet] [Thesis]. University of Waterloo; 2018. [cited 2019 Sep 16]. Available from: http://hdl.handle.net/10012/13103.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Arroyo Guevara AM. On Geometric Drawings of Graphs. [Thesis]. University of Waterloo; 2018. Available from: http://hdl.handle.net/10012/13103

Not specified: Masters Thesis or Doctoral Dissertation

Ryerson University

22. Patel, Sonal. Clique Listing Algorithms and Characteristics of Cliques in Random Graphics.

Degree: 2010, Ryerson University

URL: https://digital.library.ryerson.ca/islandora/object/RULA%3A1845

► In this thesis we address three main problems in clique detection in the area of *Graph* *Theory*. i) Most of current methods for clique detection…
(more)

Subjects/Keywords: Random graphs; Graph theory; Algorithms; Graph algorithms

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Patel, S. (2010). Clique Listing Algorithms and Characteristics of Cliques in Random Graphics. (Thesis). Ryerson University. Retrieved from https://digital.library.ryerson.ca/islandora/object/RULA%3A1845

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Patel, Sonal. “Clique Listing Algorithms and Characteristics of Cliques in Random Graphics.” 2010. Thesis, Ryerson University. Accessed September 16, 2019. https://digital.library.ryerson.ca/islandora/object/RULA%3A1845.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Patel, Sonal. “Clique Listing Algorithms and Characteristics of Cliques in Random Graphics.” 2010. Web. 16 Sep 2019.

Vancouver:

Patel S. Clique Listing Algorithms and Characteristics of Cliques in Random Graphics. [Internet] [Thesis]. Ryerson University; 2010. [cited 2019 Sep 16]. Available from: https://digital.library.ryerson.ca/islandora/object/RULA%3A1845.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Patel S. Clique Listing Algorithms and Characteristics of Cliques in Random Graphics. [Thesis]. Ryerson University; 2010. Available from: https://digital.library.ryerson.ca/islandora/object/RULA%3A1845

Not specified: Masters Thesis or Doctoral Dissertation

University of Waterloo

23. Zhan, Hanmeng. Discrete Quantum Walks on Graphs and Digraphs.

Degree: 2018, University of Waterloo

URL: http://hdl.handle.net/10012/13952

► This thesis studies various models of discrete quantum walks on graphs and digraphs via a spectral approach. A discrete quantum walk on a digraph X…
(more)

Subjects/Keywords: algebraic graph theory; quantum walks; graph embeddings

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Zhan, H. (2018). Discrete Quantum Walks on Graphs and Digraphs. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/13952

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Zhan, Hanmeng. “Discrete Quantum Walks on Graphs and Digraphs.” 2018. Thesis, University of Waterloo. Accessed September 16, 2019. http://hdl.handle.net/10012/13952.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Zhan, Hanmeng. “Discrete Quantum Walks on Graphs and Digraphs.” 2018. Web. 16 Sep 2019.

Vancouver:

Zhan H. Discrete Quantum Walks on Graphs and Digraphs. [Internet] [Thesis]. University of Waterloo; 2018. [cited 2019 Sep 16]. Available from: http://hdl.handle.net/10012/13952.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Zhan H. Discrete Quantum Walks on Graphs and Digraphs. [Thesis]. University of Waterloo; 2018. Available from: http://hdl.handle.net/10012/13952

Not specified: Masters Thesis or Doctoral Dissertation

University of Waterloo

24. Gordon, Taylor. Simultaneously Embedding Planar Graphs at Fixed Vertex Locations.

Degree: 2010, University of Waterloo

URL: http://hdl.handle.net/10012/5174

► We discuss the problem of embedding planar graphs onto the plane with pre-specified vertex locations. In particular, we introduce a method for constructing such an…
(more)

Subjects/Keywords: Graph Drawing; Simultaneous Embeddings; Graph Theory

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Gordon, T. (2010). Simultaneously Embedding Planar Graphs at Fixed Vertex Locations. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/5174

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Gordon, Taylor. “Simultaneously Embedding Planar Graphs at Fixed Vertex Locations.” 2010. Thesis, University of Waterloo. Accessed September 16, 2019. http://hdl.handle.net/10012/5174.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Gordon, Taylor. “Simultaneously Embedding Planar Graphs at Fixed Vertex Locations.” 2010. Web. 16 Sep 2019.

Vancouver:

Gordon T. Simultaneously Embedding Planar Graphs at Fixed Vertex Locations. [Internet] [Thesis]. University of Waterloo; 2010. [cited 2019 Sep 16]. Available from: http://hdl.handle.net/10012/5174.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Gordon T. Simultaneously Embedding Planar Graphs at Fixed Vertex Locations. [Thesis]. University of Waterloo; 2010. Available from: http://hdl.handle.net/10012/5174

Not specified: Masters Thesis or Doctoral Dissertation

University of Newcastle

25.
Tanna, Dushyant.
* Graph* labeling techniques.

Degree: PhD, 2017, University of Newcastle

URL: http://hdl.handle.net/1959.13/1354312

►

Research Doctorate - Doctor of Philosophy (PhD)

We give some background to the labeling schemes like graceful, harmonious, magic, antimagic and irregular total labelings. Followed… (more)

Subjects/Keywords: graph theory; vertices; graph labeling; combinatorics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Tanna, D. (2017). Graph labeling techniques. (Doctoral Dissertation). University of Newcastle. Retrieved from http://hdl.handle.net/1959.13/1354312

Chicago Manual of Style (16^{th} Edition):

Tanna, Dushyant. “Graph labeling techniques.” 2017. Doctoral Dissertation, University of Newcastle. Accessed September 16, 2019. http://hdl.handle.net/1959.13/1354312.

MLA Handbook (7^{th} Edition):

Tanna, Dushyant. “Graph labeling techniques.” 2017. Web. 16 Sep 2019.

Vancouver:

Tanna D. Graph labeling techniques. [Internet] [Doctoral dissertation]. University of Newcastle; 2017. [cited 2019 Sep 16]. Available from: http://hdl.handle.net/1959.13/1354312.

Council of Science Editors:

Tanna D. Graph labeling techniques. [Doctoral Dissertation]. University of Newcastle; 2017. Available from: http://hdl.handle.net/1959.13/1354312

Hong Kong University of Science and Technology

26. Liu, Xiaogang. Spectral characterization and spectral estimation of some graphs.

Degree: 2011, Hong Kong University of Science and Technology

URL: https://doi.org/10.14711/thesis-b1129753 ; http://repository.ust.hk/ir/bitstream/1783.1-7091/1/th_redirect.html

► This thesis studies two subjects. One is the spectral characterization problem, the other is the spectral estimation probelm. For the former, we mainly investigate the…
(more)

Subjects/Keywords: Graph theory; Spectral theory (Mathematics); Estimation theory

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Liu, X. (2011). Spectral characterization and spectral estimation of some graphs. (Thesis). Hong Kong University of Science and Technology. Retrieved from https://doi.org/10.14711/thesis-b1129753 ; http://repository.ust.hk/ir/bitstream/1783.1-7091/1/th_redirect.html

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Liu, Xiaogang. “Spectral characterization and spectral estimation of some graphs.” 2011. Thesis, Hong Kong University of Science and Technology. Accessed September 16, 2019. https://doi.org/10.14711/thesis-b1129753 ; http://repository.ust.hk/ir/bitstream/1783.1-7091/1/th_redirect.html.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Liu, Xiaogang. “Spectral characterization and spectral estimation of some graphs.” 2011. Web. 16 Sep 2019.

Vancouver:

Liu X. Spectral characterization and spectral estimation of some graphs. [Internet] [Thesis]. Hong Kong University of Science and Technology; 2011. [cited 2019 Sep 16]. Available from: https://doi.org/10.14711/thesis-b1129753 ; http://repository.ust.hk/ir/bitstream/1783.1-7091/1/th_redirect.html.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Liu X. Spectral characterization and spectral estimation of some graphs. [Thesis]. Hong Kong University of Science and Technology; 2011. Available from: https://doi.org/10.14711/thesis-b1129753 ; http://repository.ust.hk/ir/bitstream/1783.1-7091/1/th_redirect.html

Not specified: Masters Thesis or Doctoral Dissertation

University of Cambridge

27. Ferra Gomes de Almeida Girão, António José. Extremal and structural problems of graphs.

Degree: PhD, 2019, University of Cambridge

URL: https://www.repository.cam.ac.uk/handle/1810/285427 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.763777

► In this dissertation, we are interested in studying several parameters of graphs and understanding their extreme values. We begin in Chapter~2 with a question on…
(more)

Subjects/Keywords: Combinatorics; Extremal Graph Theory; Structural Graph Theory; Ramsey theory; Extremal Combinatorics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Ferra Gomes de Almeida Girão, A. J. (2019). Extremal and structural problems of graphs. (Doctoral Dissertation). University of Cambridge. Retrieved from https://www.repository.cam.ac.uk/handle/1810/285427 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.763777

Chicago Manual of Style (16^{th} Edition):

Ferra Gomes de Almeida Girão, António José. “Extremal and structural problems of graphs.” 2019. Doctoral Dissertation, University of Cambridge. Accessed September 16, 2019. https://www.repository.cam.ac.uk/handle/1810/285427 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.763777.

MLA Handbook (7^{th} Edition):

Ferra Gomes de Almeida Girão, António José. “Extremal and structural problems of graphs.” 2019. Web. 16 Sep 2019.

Vancouver:

Ferra Gomes de Almeida Girão AJ. Extremal and structural problems of graphs. [Internet] [Doctoral dissertation]. University of Cambridge; 2019. [cited 2019 Sep 16]. Available from: https://www.repository.cam.ac.uk/handle/1810/285427 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.763777.

Council of Science Editors:

Ferra Gomes de Almeida Girão AJ. Extremal and structural problems of graphs. [Doctoral Dissertation]. University of Cambridge; 2019. Available from: https://www.repository.cam.ac.uk/handle/1810/285427 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.763777

Western Michigan University

28.
Olejniczak, Drake.
Variations in Ramsey * Theory*.

Degree: PhD, Mathematics, 2019, Western Michigan University

URL: https://scholarworks.wmich.edu/dissertations/3411

► The Ramsey number R(F,H) of two graphs F and H is the smallest positive integer n for which every red-blue coloring of the (edges…
(more)

Subjects/Keywords: combinatorics; Ramsey Theory; graph theory; chromatic graph theory; Mathematics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Olejniczak, D. (2019). Variations in Ramsey Theory. (Doctoral Dissertation). Western Michigan University. Retrieved from https://scholarworks.wmich.edu/dissertations/3411

Chicago Manual of Style (16^{th} Edition):

Olejniczak, Drake. “Variations in Ramsey Theory.” 2019. Doctoral Dissertation, Western Michigan University. Accessed September 16, 2019. https://scholarworks.wmich.edu/dissertations/3411.

MLA Handbook (7^{th} Edition):

Olejniczak, Drake. “Variations in Ramsey Theory.” 2019. Web. 16 Sep 2019.

Vancouver:

Olejniczak D. Variations in Ramsey Theory. [Internet] [Doctoral dissertation]. Western Michigan University; 2019. [cited 2019 Sep 16]. Available from: https://scholarworks.wmich.edu/dissertations/3411.

Council of Science Editors:

Olejniczak D. Variations in Ramsey Theory. [Doctoral Dissertation]. Western Michigan University; 2019. Available from: https://scholarworks.wmich.edu/dissertations/3411

East Tennessee State University

29.
Samani, Franklina.
On Properties of r_{w}-Regular Graphs.

Degree: MS, Mathematical Sciences, 2015, East Tennessee State University

URL: https://dc.etsu.edu/etd/2601

► If every vertex in a *graph* G has the same degree, then the *graph* is called a regular *graph*. That is, if deg(v) =…
(more)

Subjects/Keywords: graph theory; weighted graph; aw-regular graph.; Mathematics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Samani, F. (2015). On Properties of r_{w}-Regular Graphs. (Masters Thesis). East Tennessee State University. Retrieved from https://dc.etsu.edu/etd/2601

Chicago Manual of Style (16^{th} Edition):

Samani, Franklina. “On Properties of r_{w}-Regular Graphs.” 2015. Masters Thesis, East Tennessee State University. Accessed September 16, 2019.
https://dc.etsu.edu/etd/2601.

MLA Handbook (7^{th} Edition):

Samani, Franklina. “On Properties of r_{w}-Regular Graphs.” 2015. Web. 16 Sep 2019.

Vancouver:

Samani F. On Properties of r_{w}-Regular Graphs. [Internet] [Masters thesis]. East Tennessee State University; 2015. [cited 2019 Sep 16].
Available from: https://dc.etsu.edu/etd/2601.

Council of Science Editors:

Samani F. On Properties of r_{w}-Regular Graphs. [Masters Thesis]. East Tennessee State University; 2015. Available from: https://dc.etsu.edu/etd/2601

University of Alberta

30. Zhang,Xinxin. A Model-Based Method for Content Validation of Automatically Generated Test Items.

Degree: MEd, Department of Educational Psychology, 2016, University of Alberta

URL: https://era.library.ualberta.ca/files/c8w32r576x

► The purpose of this study is to describe a methodology to recover the model (cognitive and item models) from generated test items using a novel…
(more)

Subjects/Keywords: AIG; graph theory; cognitive model

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Zhang,Xinxin. (2016). A Model-Based Method for Content Validation of Automatically Generated Test Items. (Masters Thesis). University of Alberta. Retrieved from https://era.library.ualberta.ca/files/c8w32r576x

Note: this citation may be lacking information needed for this citation format:

Author name may be incomplete

Chicago Manual of Style (16^{th} Edition):

Zhang,Xinxin. “A Model-Based Method for Content Validation of Automatically Generated Test Items.” 2016. Masters Thesis, University of Alberta. Accessed September 16, 2019. https://era.library.ualberta.ca/files/c8w32r576x.

Note: this citation may be lacking information needed for this citation format:

Author name may be incomplete

MLA Handbook (7^{th} Edition):

Zhang,Xinxin. “A Model-Based Method for Content Validation of Automatically Generated Test Items.” 2016. Web. 16 Sep 2019.

Note: this citation may be lacking information needed for this citation format:

Author name may be incomplete

Vancouver:

Zhang,Xinxin. A Model-Based Method for Content Validation of Automatically Generated Test Items. [Internet] [Masters thesis]. University of Alberta; 2016. [cited 2019 Sep 16]. Available from: https://era.library.ualberta.ca/files/c8w32r576x.

Author name may be incomplete

Council of Science Editors:

Zhang,Xinxin. A Model-Based Method for Content Validation of Automatically Generated Test Items. [Masters Thesis]. University of Alberta; 2016. Available from: https://era.library.ualberta.ca/files/c8w32r576x

Author name may be incomplete