Advanced search options
You searched for subject:(Graph)
.
Showing records 1 – 30 of
4935 total matches.
◁ [1] [2] [3] [4] [5] … [165] ▶
Search Limiters
Dates
Universities
Department
Degrees
Levels
Languages
Country
▼ Search Limiters
Mississippi State University
1. Cancela, Elias Damian. Circulant digraph isomorphisms.
Degree: MS, Mathematics and Statistics, 2016, Mississippi State University
URL: http://sun.library.msstate.edu/ETD-db/theses/available/etd-04222016-140710/
;
Subjects/Keywords: isomorphism; Cayley graph; CI-graph; circulant graph.
Record Details
Similar Records
❌
APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager
APA (6th Edition):
Cancela, E. D. (2016). Circulant digraph isomorphisms. (Masters Thesis). Mississippi State University. Retrieved from http://sun.library.msstate.edu/ETD-db/theses/available/etd-04222016-140710/ ;
Chicago Manual of Style (16th Edition):
Cancela, Elias Damian. “Circulant digraph isomorphisms.” 2016. Masters Thesis, Mississippi State University. Accessed March 07, 2021. http://sun.library.msstate.edu/ETD-db/theses/available/etd-04222016-140710/ ;.
MLA Handbook (7th Edition):
Cancela, Elias Damian. “Circulant digraph isomorphisms.” 2016. Web. 07 Mar 2021.
Vancouver:
Cancela ED. Circulant digraph isomorphisms. [Internet] [Masters thesis]. Mississippi State University; 2016. [cited 2021 Mar 07]. Available from: http://sun.library.msstate.edu/ETD-db/theses/available/etd-04222016-140710/ ;.
Council of Science Editors:
Cancela ED. Circulant digraph isomorphisms. [Masters Thesis]. Mississippi State University; 2016. Available from: http://sun.library.msstate.edu/ETD-db/theses/available/etd-04222016-140710/ ;
Vanderbilt University
2. Solava, Ryan William. On the fine structure of graphs avoiding certain complete bipartite minors.
Degree: PhD, Mathematics, 2019, Vanderbilt University
URL: http://hdl.handle.net/1803/13941
Subjects/Keywords: Graph theory; Graph minors
Record Details
Similar Records
❌
APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager
APA (6th Edition):
Solava, R. W. (2019). On the fine structure of graphs avoiding certain complete bipartite minors. (Doctoral Dissertation). Vanderbilt University. Retrieved from http://hdl.handle.net/1803/13941
Chicago Manual of Style (16th Edition):
Solava, Ryan William. “On the fine structure of graphs avoiding certain complete bipartite minors.” 2019. Doctoral Dissertation, Vanderbilt University. Accessed March 07, 2021. http://hdl.handle.net/1803/13941.
MLA Handbook (7th Edition):
Solava, Ryan William. “On the fine structure of graphs avoiding certain complete bipartite minors.” 2019. Web. 07 Mar 2021.
Vancouver:
Solava RW. On the fine structure of graphs avoiding certain complete bipartite minors. [Internet] [Doctoral dissertation]. Vanderbilt University; 2019. [cited 2021 Mar 07]. Available from: http://hdl.handle.net/1803/13941.
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://hdl.handle.net/1803/13941
University of Johannesburg
3. Desormeaux, Wyatt Jules. Total domination in graphs and graph modifications.
Degree: PhD, 2012, University of Johannesburg
URL: http://hdl.handle.net/10210/6158
Subjects/Keywords: Graph theory; Domination (Graph theory)
Record Details
Similar Records
❌
APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager
APA (6th 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 (16th Edition):
Desormeaux, Wyatt Jules. “Total domination in graphs and graph modifications.” 2012. Doctoral Dissertation, University of Johannesburg. Accessed March 07, 2021. http://hdl.handle.net/10210/6158.
MLA Handbook (7th Edition):
Desormeaux, Wyatt Jules. “Total domination in graphs and graph modifications.” 2012. Web. 07 Mar 2021.
Vancouver:
Desormeaux WJ. Total domination in graphs and graph modifications. [Internet] [Doctoral dissertation]. University of Johannesburg; 2012. [cited 2021 Mar 07]. 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 Waterloo
4. Kroeker, Matthew Eliot. Sparsity in Critical Graphs with Small Clique Number.
Degree: 2020, University of Waterloo
URL: http://hdl.handle.net/10012/16178
Subjects/Keywords: graph theory; graph colouring
Record Details
Similar Records
❌
APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager
APA (6th Edition):
Kroeker, M. E. (2020). Sparsity in Critical Graphs with Small Clique Number. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/16178
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Kroeker, Matthew Eliot. “Sparsity in Critical Graphs with Small Clique Number.” 2020. Thesis, University of Waterloo. Accessed March 07, 2021. http://hdl.handle.net/10012/16178.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Kroeker, Matthew Eliot. “Sparsity in Critical Graphs with Small Clique Number.” 2020. Web. 07 Mar 2021.
Vancouver:
Kroeker ME. Sparsity in Critical Graphs with Small Clique Number. [Internet] [Thesis]. University of Waterloo; 2020. [cited 2021 Mar 07]. Available from: http://hdl.handle.net/10012/16178.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Kroeker ME. Sparsity in Critical Graphs with Small Clique Number. [Thesis]. University of Waterloo; 2020. Available from: http://hdl.handle.net/10012/16178
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
University of Waterloo
5. 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
Subjects/Keywords: Graph Theory; Graph Colouring
Record Details
Similar Records
❌
APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager
APA (6th 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 (16th Edition):
Sullivan, Matthew. “Planar graphs without 3-cycles and with 4-cycles far apart are 3-choosable.” 2016. Thesis, University of Waterloo. Accessed March 07, 2021. 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 (7th Edition):
Sullivan, Matthew. “Planar graphs without 3-cycles and with 4-cycles far apart are 3-choosable.” 2016. Web. 07 Mar 2021.
Vancouver:
Sullivan M. Planar graphs without 3-cycles and with 4-cycles far apart are 3-choosable. [Internet] [Thesis]. University of Waterloo; 2016. [cited 2021 Mar 07]. 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
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
University of Illinois – Urbana-Champaign
6. Liu, Xiyang. Graph matching by graph neural network.
Degree: MS, Electrical & Computer Engr, 2018, University of Illinois – Urbana-Champaign
URL: http://hdl.handle.net/2142/102848
Subjects/Keywords: Graph Neural Network; Graph Matching
Record Details
Similar Records
❌
APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager
APA (6th Edition):
Liu, X. (2018). Graph matching by graph neural network. (Thesis). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/102848
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Liu, Xiyang. “Graph matching by graph neural network.” 2018. Thesis, University of Illinois – Urbana-Champaign. Accessed March 07, 2021. http://hdl.handle.net/2142/102848.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Liu, Xiyang. “Graph matching by graph neural network.” 2018. Web. 07 Mar 2021.
Vancouver:
Liu X. Graph matching by graph neural network. [Internet] [Thesis]. University of Illinois – Urbana-Champaign; 2018. [cited 2021 Mar 07]. Available from: http://hdl.handle.net/2142/102848.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Liu X. Graph matching by graph neural network. [Thesis]. University of Illinois – Urbana-Champaign; 2018. Available from: http://hdl.handle.net/2142/102848
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Rochester Institute of Technology
7. Culak, Juraj. Separators in High-Genus Near-Planar Graphs.
Degree: MS, Computer Science (GCCIS), 2016, Rochester Institute of Technology
URL: https://scholarworks.rit.edu/theses/9427
Subjects/Keywords: Graph separators
Record Details
Similar Records
❌
APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager
APA (6th Edition):
Culak, J. (2016). Separators in High-Genus Near-Planar Graphs. (Masters Thesis). Rochester Institute of Technology. Retrieved from https://scholarworks.rit.edu/theses/9427
Chicago Manual of Style (16th Edition):
Culak, Juraj. “Separators in High-Genus Near-Planar Graphs.” 2016. Masters Thesis, Rochester Institute of Technology. Accessed March 07, 2021. https://scholarworks.rit.edu/theses/9427.
MLA Handbook (7th Edition):
Culak, Juraj. “Separators in High-Genus Near-Planar Graphs.” 2016. Web. 07 Mar 2021.
Vancouver:
Culak J. Separators in High-Genus Near-Planar Graphs. [Internet] [Masters thesis]. Rochester Institute of Technology; 2016. [cited 2021 Mar 07]. Available from: https://scholarworks.rit.edu/theses/9427.
Council of Science Editors:
Culak J. Separators in High-Genus Near-Planar Graphs. [Masters Thesis]. Rochester Institute of Technology; 2016. Available from: https://scholarworks.rit.edu/theses/9427
8. Souza, Renato Ferreira de. Resolução de problemas via teoria de grafos.
Degree: Mestrado, Mestrado Profissional em Matemática em Rede Nacional, 2015, University of São Paulo
URL: http://www.teses.usp.br/teses/disponiveis/55/55136/tde-06072015-103319/
;
Subjects/Keywords: Grafos; Graph
Record Details
Similar Records
❌
APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager
APA (6th Edition):
Souza, R. F. d. (2015). Resolução de problemas via teoria de grafos. (Masters Thesis). University of São Paulo. Retrieved from http://www.teses.usp.br/teses/disponiveis/55/55136/tde-06072015-103319/ ;
Chicago Manual of Style (16th Edition):
Souza, Renato Ferreira de. “Resolução de problemas via teoria de grafos.” 2015. Masters Thesis, University of São Paulo. Accessed March 07, 2021. http://www.teses.usp.br/teses/disponiveis/55/55136/tde-06072015-103319/ ;.
MLA Handbook (7th Edition):
Souza, Renato Ferreira de. “Resolução de problemas via teoria de grafos.” 2015. Web. 07 Mar 2021.
Vancouver:
Souza RFd. Resolução de problemas via teoria de grafos. [Internet] [Masters thesis]. University of São Paulo; 2015. [cited 2021 Mar 07]. Available from: http://www.teses.usp.br/teses/disponiveis/55/55136/tde-06072015-103319/ ;.
Council of Science Editors:
Souza RFd. Resolução de problemas via teoria de grafos. [Masters Thesis]. University of São Paulo; 2015. Available from: http://www.teses.usp.br/teses/disponiveis/55/55136/tde-06072015-103319/ ;
Texas A&M University
9. Xia, Xiangzhou. Efficient and Scalable Listing of Four-Vertex Subgraph.
Degree: MS, Computer Science, 2016, Texas A&M University
URL: http://hdl.handle.net/1969.1/174219
Subjects/Keywords: graph; motif
Record Details
Similar Records
❌
APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager
APA (6th Edition):
Xia, X. (2016). Efficient and Scalable Listing of Four-Vertex Subgraph. (Masters Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/174219
Chicago Manual of Style (16th Edition):
Xia, Xiangzhou. “Efficient and Scalable Listing of Four-Vertex Subgraph.” 2016. Masters Thesis, Texas A&M University. Accessed March 07, 2021. http://hdl.handle.net/1969.1/174219.
MLA Handbook (7th Edition):
Xia, Xiangzhou. “Efficient and Scalable Listing of Four-Vertex Subgraph.” 2016. Web. 07 Mar 2021.
Vancouver:
Xia X. Efficient and Scalable Listing of Four-Vertex Subgraph. [Internet] [Masters thesis]. Texas A&M University; 2016. [cited 2021 Mar 07]. Available from: http://hdl.handle.net/1969.1/174219.
Council of Science Editors:
Xia X. Efficient and Scalable Listing of Four-Vertex Subgraph. [Masters Thesis]. Texas A&M University; 2016. Available from: http://hdl.handle.net/1969.1/174219
University of Waterloo
10. Clancy, Ryan. dstlr: Scalable Knowledge Graph Construction from Text Collections.
Degree: 2020, University of Waterloo
URL: http://hdl.handle.net/10012/15739
Subjects/Keywords: knowledge graph
Record Details
Similar Records
❌
APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager
APA (6th Edition):
Clancy, R. (2020). dstlr: Scalable Knowledge Graph Construction from Text Collections. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/15739
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Clancy, Ryan. “dstlr: Scalable Knowledge Graph Construction from Text Collections.” 2020. Thesis, University of Waterloo. Accessed March 07, 2021. http://hdl.handle.net/10012/15739.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Clancy, Ryan. “dstlr: Scalable Knowledge Graph Construction from Text Collections.” 2020. Web. 07 Mar 2021.
Vancouver:
Clancy R. dstlr: Scalable Knowledge Graph Construction from Text Collections. [Internet] [Thesis]. University of Waterloo; 2020. [cited 2021 Mar 07]. Available from: http://hdl.handle.net/10012/15739.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Clancy R. dstlr: Scalable Knowledge Graph Construction from Text Collections. [Thesis]. University of Waterloo; 2020. Available from: http://hdl.handle.net/10012/15739
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
University of Waterloo
11. de Jong, Jamie. Jaeger’s Strong 3-Flow Conjecture for Graphs in Low Genus Surfaces.
Degree: 2020, University of Waterloo
URL: http://hdl.handle.net/10012/15821
Subjects/Keywords: Graph theory
Record Details
Similar Records
❌
APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager
APA (6th Edition):
de Jong, J. (2020). Jaeger’s Strong 3-Flow Conjecture for Graphs in Low Genus Surfaces. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/15821
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
de Jong, Jamie. “Jaeger’s Strong 3-Flow Conjecture for Graphs in Low Genus Surfaces.” 2020. Thesis, University of Waterloo. Accessed March 07, 2021. http://hdl.handle.net/10012/15821.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
de Jong, Jamie. “Jaeger’s Strong 3-Flow Conjecture for Graphs in Low Genus Surfaces.” 2020. Web. 07 Mar 2021.
Vancouver:
de Jong J. Jaeger’s Strong 3-Flow Conjecture for Graphs in Low Genus Surfaces. [Internet] [Thesis]. University of Waterloo; 2020. [cited 2021 Mar 07]. Available from: http://hdl.handle.net/10012/15821.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
de Jong J. Jaeger’s Strong 3-Flow Conjecture for Graphs in Low Genus Surfaces. [Thesis]. University of Waterloo; 2020. Available from: http://hdl.handle.net/10012/15821
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
University of Johannesburg
12. Immelman, Yolande. On the (upper) line-distinguishing and (upper) harmonious chromatic numbers of a graph.
Degree: 2009, University of Johannesburg
URL: http://hdl.handle.net/10210/2359
Subjects/Keywords: Graph coloring
Record Details
Similar Records
❌
APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager
APA (6th Edition):
Immelman, Y. (2009). On the (upper) line-distinguishing and (upper) harmonious chromatic numbers of a graph. (Thesis). University of Johannesburg. Retrieved from http://hdl.handle.net/10210/2359
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Immelman, Yolande. “On the (upper) line-distinguishing and (upper) harmonious chromatic numbers of a graph.” 2009. Thesis, University of Johannesburg. Accessed March 07, 2021. http://hdl.handle.net/10210/2359.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Immelman, Yolande. “On the (upper) line-distinguishing and (upper) harmonious chromatic numbers of a graph.” 2009. Web. 07 Mar 2021.
Vancouver:
Immelman Y. On the (upper) line-distinguishing and (upper) harmonious chromatic numbers of a graph. [Internet] [Thesis]. University of Johannesburg; 2009. [cited 2021 Mar 07]. Available from: http://hdl.handle.net/10210/2359.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Immelman Y. On the (upper) line-distinguishing and (upper) harmonious chromatic numbers of a graph. [Thesis]. University of Johannesburg; 2009. Available from: http://hdl.handle.net/10210/2359
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Wake Forest University
13. Barnett, Joel Andrew. Generalizations and Variations on Graph Pebbling.
Degree: 2014, Wake Forest University
URL: http://hdl.handle.net/10339/39310
Subjects/Keywords: graph pebbling
Record Details
Similar Records
❌
APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager
APA (6th Edition):
Barnett, J. A. (2014). Generalizations and Variations on Graph Pebbling. (Thesis). Wake Forest University. Retrieved from http://hdl.handle.net/10339/39310
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Barnett, Joel Andrew. “Generalizations and Variations on Graph Pebbling.” 2014. Thesis, Wake Forest University. Accessed March 07, 2021. http://hdl.handle.net/10339/39310.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Barnett, Joel Andrew. “Generalizations and Variations on Graph Pebbling.” 2014. Web. 07 Mar 2021.
Vancouver:
Barnett JA. Generalizations and Variations on Graph Pebbling. [Internet] [Thesis]. Wake Forest University; 2014. [cited 2021 Mar 07]. Available from: http://hdl.handle.net/10339/39310.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Barnett JA. Generalizations and Variations on Graph Pebbling. [Thesis]. Wake Forest University; 2014. Available from: http://hdl.handle.net/10339/39310
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
University of Newcastle
14. Wijaya, Rachel Wulan Nirmalasari. Advances in graph labelings.
Degree: MPhil, 2018, University of Newcastle
URL: http://hdl.handle.net/1959.13/1384118
Subjects/Keywords: graph labelings
Record Details
Similar Records
❌
APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager
APA (6th Edition):
Wijaya, R. W. N. (2018). Advances in graph labelings. (Masters Thesis). University of Newcastle. Retrieved from http://hdl.handle.net/1959.13/1384118
Chicago Manual of Style (16th Edition):
Wijaya, Rachel Wulan Nirmalasari. “Advances in graph labelings.” 2018. Masters Thesis, University of Newcastle. Accessed March 07, 2021. http://hdl.handle.net/1959.13/1384118.
MLA Handbook (7th Edition):
Wijaya, Rachel Wulan Nirmalasari. “Advances in graph labelings.” 2018. Web. 07 Mar 2021.
Vancouver:
Wijaya RWN. Advances in graph labelings. [Internet] [Masters thesis]. University of Newcastle; 2018. [cited 2021 Mar 07]. Available from: http://hdl.handle.net/1959.13/1384118.
Council of Science Editors:
Wijaya RWN. Advances in graph labelings. [Masters Thesis]. University of Newcastle; 2018. Available from: http://hdl.handle.net/1959.13/1384118
University of Victoria
15.
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
Subjects/Keywords: graph theory
Record Details
Similar Records
❌
APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager
APA (6th 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 (16th 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 March 07, 2021. http://hdl.handle.net/1828/7341.
MLA Handbook (7th Edition):
Gelling, Eric Neil. “On 1-factorizations of the complete graph and the relationship to round robin schedules.” 2016. Web. 07 Mar 2021.
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 2021 Mar 07]. 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
16. Fuller, Brandon. Finding CCA groups and graphs algorithmically .
Degree: 2018, University of Lethbridge
URL: http://hdl.handle.net/10133/4996
Subjects/Keywords: Cayley graph
Record Details
Similar Records
❌
APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager
APA (6th Edition):
Fuller, B. (2018). Finding CCA groups and graphs algorithmically . (Thesis). University of Lethbridge. Retrieved from http://hdl.handle.net/10133/4996
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Fuller, Brandon. “Finding CCA groups and graphs algorithmically .” 2018. Thesis, University of Lethbridge. Accessed March 07, 2021. http://hdl.handle.net/10133/4996.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Fuller, Brandon. “Finding CCA groups and graphs algorithmically .” 2018. Web. 07 Mar 2021.
Vancouver:
Fuller B. Finding CCA groups and graphs algorithmically . [Internet] [Thesis]. University of Lethbridge; 2018. [cited 2021 Mar 07]. Available from: http://hdl.handle.net/10133/4996.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Fuller B. Finding CCA groups and graphs algorithmically . [Thesis]. University of Lethbridge; 2018. Available from: http://hdl.handle.net/10133/4996
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Louisiana State University
17. 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
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 (6th 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 (16th Edition):
D'souza, Kimberly Sevin. “Excluding a Weakly 4-connected Minor.” 2016. Doctoral Dissertation, Louisiana State University. Accessed March 07, 2021. etd-04042016-220803 ; https://digitalcommons.lsu.edu/gradschool_dissertations/1368.
MLA Handbook (7th Edition):
D'souza, Kimberly Sevin. “Excluding a Weakly 4-connected Minor.” 2016. Web. 07 Mar 2021.
Vancouver:
D'souza KS. Excluding a Weakly 4-connected Minor. [Internet] [Doctoral dissertation]. Louisiana State University; 2016. [cited 2021 Mar 07]. 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 New South Wales
18.
Shang, Haichuan.
Efficient algorithms for graph substructure search.
Degree: Computer Science & Engineering, 2011, University of New South Wales
URL: http://handle.unsw.edu.au/1959.4/51214
;
https://unsworks.unsw.edu.au/fapi/datastream/unsworks:9931/SOURCE02?view=true
Subjects/Keywords: Graph database
Record Details
Similar Records
❌
APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager
APA (6th Edition):
Shang, H. (2011). Efficient algorithms for graph substructure search. (Doctoral Dissertation). University of New South Wales. Retrieved from http://handle.unsw.edu.au/1959.4/51214 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:9931/SOURCE02?view=true
Chicago Manual of Style (16th Edition):
Shang, Haichuan. “Efficient algorithms for graph substructure search.” 2011. Doctoral Dissertation, University of New South Wales. Accessed March 07, 2021. http://handle.unsw.edu.au/1959.4/51214 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:9931/SOURCE02?view=true.
MLA Handbook (7th Edition):
Shang, Haichuan. “Efficient algorithms for graph substructure search.” 2011. Web. 07 Mar 2021.
Vancouver:
Shang H. Efficient algorithms for graph substructure search. [Internet] [Doctoral dissertation]. University of New South Wales; 2011. [cited 2021 Mar 07]. Available from: http://handle.unsw.edu.au/1959.4/51214 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:9931/SOURCE02?view=true.
Council of Science Editors:
Shang H. Efficient algorithms for graph substructure search. [Doctoral Dissertation]. University of New South Wales; 2011. Available from: http://handle.unsw.edu.au/1959.4/51214 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:9931/SOURCE02?view=true
Washington State University
19. [No author]. Query-driven Exploration of Big Graphs .
Degree: 2019, Washington State University
URL: http://hdl.handle.net/2376/17891
Subjects/Keywords: Computer science; Exploratory Search; Graph Database; Graph Exploration; Graph Mining; Graph Querying; Graph Streams
Record Details
Similar Records
❌
APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager
APA (6th Edition):
author], [. (2019). Query-driven Exploration of Big Graphs . (Thesis). Washington State University. Retrieved from http://hdl.handle.net/2376/17891
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
author], [No. “Query-driven Exploration of Big Graphs .” 2019. Thesis, Washington State University. Accessed March 07, 2021. http://hdl.handle.net/2376/17891.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
author], [No. “Query-driven Exploration of Big Graphs .” 2019. Web. 07 Mar 2021.
Vancouver:
author] [. Query-driven Exploration of Big Graphs . [Internet] [Thesis]. Washington State University; 2019. [cited 2021 Mar 07]. Available from: http://hdl.handle.net/2376/17891.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
author] [. Query-driven Exploration of Big Graphs . [Thesis]. Washington State University; 2019. Available from: http://hdl.handle.net/2376/17891
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Western Michigan University
20. Alhulwah, Khawlah Hamad. Structures of Derived Graphs.
Degree: PhD, Mathematics, 2017, Western Michigan University
URL: https://scholarworks.wmich.edu/dissertations/3204
Subjects/Keywords: Line graph; Peterson graph; complete graph; graph; derived graphs; 3-line graph; Applied Mathematics
Record Details
Similar Records
❌
APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager
APA (6th Edition):
Alhulwah, K. H. (2017). Structures of Derived Graphs. (Doctoral Dissertation). Western Michigan University. Retrieved from https://scholarworks.wmich.edu/dissertations/3204
Chicago Manual of Style (16th Edition):
Alhulwah, Khawlah Hamad. “Structures of Derived Graphs.” 2017. Doctoral Dissertation, Western Michigan University. Accessed March 07, 2021. https://scholarworks.wmich.edu/dissertations/3204.
MLA Handbook (7th Edition):
Alhulwah, Khawlah Hamad. “Structures of Derived Graphs.” 2017. Web. 07 Mar 2021.
Vancouver:
Alhulwah KH. Structures of Derived Graphs. [Internet] [Doctoral dissertation]. Western Michigan University; 2017. [cited 2021 Mar 07]. Available from: https://scholarworks.wmich.edu/dissertations/3204.
Council of Science Editors:
Alhulwah KH. Structures of Derived Graphs. [Doctoral Dissertation]. Western Michigan University; 2017. Available from: https://scholarworks.wmich.edu/dissertations/3204
Ryerson University
21. 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
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 (6th 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
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Patel, Sonal. “Clique Listing Algorithms and Characteristics of Cliques in Random Graphics.” 2010. Thesis, Ryerson University. Accessed March 07, 2021. https://digital.library.ryerson.ca/islandora/object/RULA%3A1845.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Patel, Sonal. “Clique Listing Algorithms and Characteristics of Cliques in Random Graphics.” 2010. Web. 07 Mar 2021.
Vancouver:
Patel S. Clique Listing Algorithms and Characteristics of Cliques in Random Graphics. [Internet] [Thesis]. Ryerson University; 2010. [cited 2021 Mar 07]. Available from: https://digital.library.ryerson.ca/islandora/object/RULA%3A1845.
Note: this citation may be lacking information needed for this citation format:
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
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Vanderbilt University
22. Schroeder, Justin Zane. Hamilton cycle embeddings of complete tripartite graphs and their applications.
Degree: PhD, Mathematics, 2012, Vanderbilt University
URL: http://hdl.handle.net/1803/10927
Subjects/Keywords: covering triangulation; graph genus; graph embedding
Record Details
Similar Records
❌
APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager
APA (6th Edition):
Schroeder, J. Z. (2012). Hamilton cycle embeddings of complete tripartite graphs and their applications. (Doctoral Dissertation). Vanderbilt University. Retrieved from http://hdl.handle.net/1803/10927
Chicago Manual of Style (16th Edition):
Schroeder, Justin Zane. “Hamilton cycle embeddings of complete tripartite graphs and their applications.” 2012. Doctoral Dissertation, Vanderbilt University. Accessed March 07, 2021. http://hdl.handle.net/1803/10927.
MLA Handbook (7th Edition):
Schroeder, Justin Zane. “Hamilton cycle embeddings of complete tripartite graphs and their applications.” 2012. Web. 07 Mar 2021.
Vancouver:
Schroeder JZ. Hamilton cycle embeddings of complete tripartite graphs and their applications. [Internet] [Doctoral dissertation]. Vanderbilt University; 2012. [cited 2021 Mar 07]. Available from: http://hdl.handle.net/1803/10927.
Council of Science Editors:
Schroeder JZ. Hamilton cycle embeddings of complete tripartite graphs and their applications. [Doctoral Dissertation]. Vanderbilt University; 2012. Available from: http://hdl.handle.net/1803/10927
University of Newcastle
23. Weaver, Natasha. A family of higher-rank graphs arising from subshifts.
Degree: PhD, 2009, University of Newcastle
URL: http://hdl.handle.net/1959.13/38511
Subjects/Keywords: operator algebras; graph algebras; higher-rank graph
Record Details
Similar Records
❌
APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager
APA (6th Edition):
Weaver, N. (2009). A family of higher-rank graphs arising from subshifts. (Doctoral Dissertation). University of Newcastle. Retrieved from http://hdl.handle.net/1959.13/38511
Chicago Manual of Style (16th Edition):
Weaver, Natasha. “A family of higher-rank graphs arising from subshifts.” 2009. Doctoral Dissertation, University of Newcastle. Accessed March 07, 2021. http://hdl.handle.net/1959.13/38511.
MLA Handbook (7th Edition):
Weaver, Natasha. “A family of higher-rank graphs arising from subshifts.” 2009. Web. 07 Mar 2021.
Vancouver:
Weaver N. A family of higher-rank graphs arising from subshifts. [Internet] [Doctoral dissertation]. University of Newcastle; 2009. [cited 2021 Mar 07]. Available from: http://hdl.handle.net/1959.13/38511.
Council of Science Editors:
Weaver N. A family of higher-rank graphs arising from subshifts. [Doctoral Dissertation]. University of Newcastle; 2009. Available from: http://hdl.handle.net/1959.13/38511
University of Newcastle
24. Tanna, Dushyant. Graph labeling techniques.
Degree: PhD, 2017, University of Newcastle
URL: http://hdl.handle.net/1959.13/1354312
Subjects/Keywords: graph theory; vertices; graph labeling; combinatorics
Record Details
Similar Records
❌
APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager
APA (6th 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 (16th Edition):
Tanna, Dushyant. “Graph labeling techniques.” 2017. Doctoral Dissertation, University of Newcastle. Accessed March 07, 2021. http://hdl.handle.net/1959.13/1354312.
MLA Handbook (7th Edition):
Tanna, Dushyant. “Graph labeling techniques.” 2017. Web. 07 Mar 2021.
Vancouver:
Tanna D. Graph labeling techniques. [Internet] [Doctoral dissertation]. University of Newcastle; 2017. [cited 2021 Mar 07]. 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
University of Victoria
25. Carr, MacKenzie. Enumerating digitally convex sets in graphs.
Degree: Department of Mathematics and Statistics, 2020, University of Victoria
URL: http://hdl.handle.net/1828/11938
Subjects/Keywords: graph; convex; digitally convex; graph theory
Record Details
Similar Records
❌
APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager
APA (6th Edition):
Carr, M. (2020). Enumerating digitally convex sets in graphs. (Masters Thesis). University of Victoria. Retrieved from http://hdl.handle.net/1828/11938
Chicago Manual of Style (16th Edition):
Carr, MacKenzie. “Enumerating digitally convex sets in graphs.” 2020. Masters Thesis, University of Victoria. Accessed March 07, 2021. http://hdl.handle.net/1828/11938.
MLA Handbook (7th Edition):
Carr, MacKenzie. “Enumerating digitally convex sets in graphs.” 2020. Web. 07 Mar 2021.
Vancouver:
Carr M. Enumerating digitally convex sets in graphs. [Internet] [Masters thesis]. University of Victoria; 2020. [cited 2021 Mar 07]. Available from: http://hdl.handle.net/1828/11938.
Council of Science Editors:
Carr M. Enumerating digitally convex sets in graphs. [Masters Thesis]. University of Victoria; 2020. Available from: http://hdl.handle.net/1828/11938
Indiana University
26. Firoz, Jesun Sahariar. Synchronization-avoiding graph algorithms and runtime aspects .
Degree: 2018, Indiana University
URL: http://hdl.handle.net/2022/22605
Subjects/Keywords: Distributed Graph Algorithms; Distributed Runtimes; Graph Algorithms
Record Details
Similar Records
❌
APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager
APA (6th Edition):
Firoz, J. S. (2018). Synchronization-avoiding graph algorithms and runtime aspects . (Thesis). Indiana University. Retrieved from http://hdl.handle.net/2022/22605
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Firoz, Jesun Sahariar. “Synchronization-avoiding graph algorithms and runtime aspects .” 2018. Thesis, Indiana University. Accessed March 07, 2021. http://hdl.handle.net/2022/22605.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Firoz, Jesun Sahariar. “Synchronization-avoiding graph algorithms and runtime aspects .” 2018. Web. 07 Mar 2021.
Vancouver:
Firoz JS. Synchronization-avoiding graph algorithms and runtime aspects . [Internet] [Thesis]. Indiana University; 2018. [cited 2021 Mar 07]. Available from: http://hdl.handle.net/2022/22605.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Firoz JS. Synchronization-avoiding graph algorithms and runtime aspects . [Thesis]. Indiana University; 2018. Available from: http://hdl.handle.net/2022/22605
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Australian National University
27. Hou, Yun. Control of Formations with Non-rigid and Hybrid Graphs .
Degree: 2016, Australian National University
URL: http://hdl.handle.net/1885/110870
Subjects/Keywords: formation control; graph rigidity; hybrid graph
Record Details
Similar Records
❌
APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager
APA (6th Edition):
Hou, Y. (2016). Control of Formations with Non-rigid and Hybrid Graphs . (Thesis). Australian National University. Retrieved from http://hdl.handle.net/1885/110870
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Hou, Yun. “Control of Formations with Non-rigid and Hybrid Graphs .” 2016. Thesis, Australian National University. Accessed March 07, 2021. http://hdl.handle.net/1885/110870.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Hou, Yun. “Control of Formations with Non-rigid and Hybrid Graphs .” 2016. Web. 07 Mar 2021.
Vancouver:
Hou Y. Control of Formations with Non-rigid and Hybrid Graphs . [Internet] [Thesis]. Australian National University; 2016. [cited 2021 Mar 07]. Available from: http://hdl.handle.net/1885/110870.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Hou Y. Control of Formations with Non-rigid and Hybrid Graphs . [Thesis]. Australian National University; 2016. Available from: http://hdl.handle.net/1885/110870
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Delft University of Technology
28. Penders, A. (author). Accelerating Graph Analysis with Heterogeneous Systems.
Degree: Software and Computer Technology, 2012, Delft University of Technology
URL: http://resolver.tudelft.nl/uuid:7f3eeb52-77bd-4fdb-84a9-ea9ca0a35b94
Subjects/Keywords: GPU; graph; Graph analysis; accelerators; OpenCL; parallel
Record Details
Similar Records
❌
APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager
APA (6th Edition):
Penders, A. (. (2012). Accelerating Graph Analysis with Heterogeneous Systems. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:7f3eeb52-77bd-4fdb-84a9-ea9ca0a35b94
Chicago Manual of Style (16th Edition):
Penders, A (author). “Accelerating Graph Analysis with Heterogeneous Systems.” 2012. Masters Thesis, Delft University of Technology. Accessed March 07, 2021. http://resolver.tudelft.nl/uuid:7f3eeb52-77bd-4fdb-84a9-ea9ca0a35b94.
MLA Handbook (7th Edition):
Penders, A (author). “Accelerating Graph Analysis with Heterogeneous Systems.” 2012. Web. 07 Mar 2021.
Vancouver:
Penders A(. Accelerating Graph Analysis with Heterogeneous Systems. [Internet] [Masters thesis]. Delft University of Technology; 2012. [cited 2021 Mar 07]. Available from: http://resolver.tudelft.nl/uuid:7f3eeb52-77bd-4fdb-84a9-ea9ca0a35b94.
Council of Science Editors:
Penders A(. Accelerating Graph Analysis with Heterogeneous Systems. [Masters Thesis]. Delft University of Technology; 2012. Available from: http://resolver.tudelft.nl/uuid:7f3eeb52-77bd-4fdb-84a9-ea9ca0a35b94
University of Victoria
29.
Manzer, Joshua Daniel Adrian.
Chronological rectangle digraphs.
Degree: Department of Mathematics and Statistics, 2015, University of Victoria
URL: http://hdl.handle.net/1828/6989
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 (6th Edition):
Manzer, J. D. A. (2015). Chronological rectangle digraphs. (Thesis). University of Victoria. Retrieved from http://hdl.handle.net/1828/6989
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Manzer, Joshua Daniel Adrian. “Chronological rectangle digraphs.” 2015. Thesis, University of Victoria. Accessed March 07, 2021. http://hdl.handle.net/1828/6989.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Manzer, Joshua Daniel Adrian. “Chronological rectangle digraphs.” 2015. Web. 07 Mar 2021.
Vancouver:
Manzer JDA. Chronological rectangle digraphs. [Internet] [Thesis]. University of Victoria; 2015. [cited 2021 Mar 07]. Available from: http://hdl.handle.net/1828/6989.
Note: this citation may be lacking information needed for this citation format:
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
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
University of Victoria
30. Bowditch, Flora Caroline. Localized structure in graph decompositions.
Degree: Department of Mathematics and Statistics, 2019, University of Victoria
URL: http://hdl.handle.net/1828/11404
Subjects/Keywords: design theory; graph theory; combinatorics; graph decompositions
Record Details
Similar Records
❌
APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager
APA (6th Edition):
Bowditch, F. C. (2019). Localized structure in graph decompositions. (Masters Thesis). University of Victoria. Retrieved from http://hdl.handle.net/1828/11404
Chicago Manual of Style (16th Edition):
Bowditch, Flora Caroline. “Localized structure in graph decompositions.” 2019. Masters Thesis, University of Victoria. Accessed March 07, 2021. http://hdl.handle.net/1828/11404.
MLA Handbook (7th Edition):
Bowditch, Flora Caroline. “Localized structure in graph decompositions.” 2019. Web. 07 Mar 2021.
Vancouver:
Bowditch FC. Localized structure in graph decompositions. [Internet] [Masters thesis]. University of Victoria; 2019. [cited 2021 Mar 07]. Available from: http://hdl.handle.net/1828/11404.
Council of Science Editors:
Bowditch FC. Localized structure in graph decompositions. [Masters Thesis]. University of Victoria; 2019. Available from: http://hdl.handle.net/1828/11404