Advanced search options

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

You searched for `subject:(Planar Graphs even hole free graphs treewidth graph theory)`

.
Showing records 1 – 30 of
80523 total matches.

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

Search Limiters

Dates

- 2017 – 2021 (20754)
- 2012 – 2016 (32055)
- 2007 – 2011 (18483)
- 2002 – 2006 (5945)
- 1997 – 2001 (2534)
- 1992 – 1996 (1597)
- 1987 – 1991 (1202)
- 1982 – 1986 (981)
- 1977 – 1981 (696)
- 1972 – 1976 (694)

Universities

- Brno University of Technology (1196)
- University of São Paulo (1083)
- The Ohio State University (1037)
- ETH Zürich (1029)
- Virginia Tech (944)
- NSYSU (915)
- University of Georgia (837)
- University of Texas – Austin (826)
- University of Michigan (819)
- Uppsala University (815)
- Georgia Tech (809)
- Michigan State University (774)
- Universitetet i Tromsø (691)
- University of Waterloo (686)
- Texas A&M University (680)

Department

- Mathematics (1574)
- Physics (821)
- Psychology (810)
- Computer Science (702)
- Economics (575)
- Sociology (502)
- English (501)
- Informatique (497)
- Education (495)
- Mechanical Engineering (478)
- Woods Hole Oceanographic Institution (476)
- Electrical and Computer Engineering (470)
- Electrical Engineering (453)
- Chemistry (380)
- Political Science (380)

Degrees

- PhD (20447)
- MS (3370)
- Docteur es (3273)
- MA (2401)
- Master (1155)
- Mestrado (608)
- EdD (422)
- phd (275)
- d_ph (182)
- Doctor of Education (EdD) (165)
- Thesis (EdD) (138)
- MFA (112)
- MSc (107)
- MM (104)
- MSc Engg (103)

Levels

- doctoral (32369)
- masters (12071)
- thesis (1180)
- dissertation (230)
- d_ph (182)
- doctor of philosophy ph.d. (145)
- thesis - unrestricted (136)
- project (54)
- 1 (52)
- doctor of philosophy (ph.d.) (51)

Languages

Country

- US (32140)
- UK (6912)
- Sweden (6107)
- Canada (5823)
- Brazil (4092)
- France (3275)
- Australia (3158)
- Netherlands (2323)
- South Africa (2180)
- Greece (1330)
- Czech Republic (1202)
- New Zealand (1101)
- Switzerland (1040)
- Taiwan (915)
- India (852)

▼ Search Limiters

1. Aline Alves da Silva. DecomposiÃÃo e largura em Ãrvore de grafos planares livres de ciclos pares induzidos.

Degree: Master, 2007, Universidade Federal do Ceará

URL: http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=1324 ;

►

Os conceitos de DecomposiÃÃo em Ãrvore e Largura em Ãrvore foram introduzidos por Robertson e Seymour em sua sÃrie de artigos sobre menores de grafos,… (more)

Subjects/Keywords: CIENCIA DA COMPUTACAO; Grafos planares, grafos livres de buracos pares, largura em Ãrvore, teoria de Grafos.; Planar Graphs, even-hole-free graphs, treewidth, graph theory

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Silva, A. A. d. (2007). DecomposiÃÃo e largura em Ãrvore de grafos planares livres de ciclos pares induzidos. (Masters Thesis). Universidade Federal do Ceará. Retrieved from http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=1324 ;

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

Silva, Aline Alves da. “DecomposiÃÃo e largura em Ãrvore de grafos planares livres de ciclos pares induzidos.” 2007. Masters Thesis, Universidade Federal do Ceará. Accessed January 19, 2021. http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=1324 ;.

MLA Handbook (7^{th} Edition):

Silva, Aline Alves da. “DecomposiÃÃo e largura em Ãrvore de grafos planares livres de ciclos pares induzidos.” 2007. Web. 19 Jan 2021.

Vancouver:

Silva AAd. DecomposiÃÃo e largura em Ãrvore de grafos planares livres de ciclos pares induzidos. [Internet] [Masters thesis]. Universidade Federal do Ceará 2007. [cited 2021 Jan 19]. Available from: http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=1324 ;.

Council of Science Editors:

Silva AAd. DecomposiÃÃo e largura em Ãrvore de grafos planares livres de ciclos pares induzidos. [Masters Thesis]. Universidade Federal do Ceará 2007. Available from: http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=1324 ;

University of Waterloo

2.
Horrocks, Courtney.
A Generalization to Signed * Graphs* of a Theorem of Sergey Norin and Robin Thomas.

Degree: 2019, University of Waterloo

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

► In this thesis we characterize the minimal non-*planar* extensions of a signed *graph*. We consider the following question: Given a subdivision of a *planar* signed…
(more)

Subjects/Keywords: signed graphs; planar; graph theory

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Horrocks, C. (2019). A Generalization to Signed Graphs of a Theorem of Sergey Norin and Robin Thomas. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/15350

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):

Horrocks, Courtney. “A Generalization to Signed Graphs of a Theorem of Sergey Norin and Robin Thomas.” 2019. Thesis, University of Waterloo. Accessed January 19, 2021. http://hdl.handle.net/10012/15350.

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

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Horrocks, Courtney. “A Generalization to Signed Graphs of a Theorem of Sergey Norin and Robin Thomas.” 2019. Web. 19 Jan 2021.

Vancouver:

Horrocks C. A Generalization to Signed Graphs of a Theorem of Sergey Norin and Robin Thomas. [Internet] [Thesis]. University of Waterloo; 2019. [cited 2021 Jan 19]. Available from: http://hdl.handle.net/10012/15350.

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

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Horrocks C. A Generalization to Signed Graphs of a Theorem of Sergey Norin and Robin Thomas. [Thesis]. University of Waterloo; 2019. Available from: http://hdl.handle.net/10012/15350

Not specified: Masters Thesis or Doctoral Dissertation

Indian Institute of Science

3.
Rajendraprasad, Deepak.
Rainbow Colouring and Some Dimensional Problems in *Graph* * Theory*.

Degree: PhD, Faculty of Engineering, 2018, Indian Institute of Science

URL: http://etd.iisc.ac.in/handle/2005/3336

► This thesis touches three diﬀerent topics in *graph* *theory*, namely, rainbow colouring, product dimension and boxicity. Rainbow colouring An edge colouring of a *graph* is…
(more)

Subjects/Keywords: Graph Theory; Rainbow Coloring - Graphs; Product Dimension - Graphs; Boxicity; Cubicity; Hypergraphs; Product Graphs; Forests Graphs; Treewidth Graphs; Tree (Graph Theory); Split Graphs; Threshold Graphs; Graph - Coloring; Rainbow Connection; Computer Science

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Rajendraprasad, D. (2018). Rainbow Colouring and Some Dimensional Problems in Graph Theory. (Doctoral Dissertation). Indian Institute of Science. Retrieved from http://etd.iisc.ac.in/handle/2005/3336

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

Rajendraprasad, Deepak. “Rainbow Colouring and Some Dimensional Problems in Graph Theory.” 2018. Doctoral Dissertation, Indian Institute of Science. Accessed January 19, 2021. http://etd.iisc.ac.in/handle/2005/3336.

MLA Handbook (7^{th} Edition):

Rajendraprasad, Deepak. “Rainbow Colouring and Some Dimensional Problems in Graph Theory.” 2018. Web. 19 Jan 2021.

Vancouver:

Rajendraprasad D. Rainbow Colouring and Some Dimensional Problems in Graph Theory. [Internet] [Doctoral dissertation]. Indian Institute of Science; 2018. [cited 2021 Jan 19]. Available from: http://etd.iisc.ac.in/handle/2005/3336.

Council of Science Editors:

Rajendraprasad D. Rainbow Colouring and Some Dimensional Problems in Graph Theory. [Doctoral Dissertation]. Indian Institute of Science; 2018. Available from: http://etd.iisc.ac.in/handle/2005/3336

University of Melbourne

4.
Harvey, Daniel John.
On *Treewidth* and *Graph* Minors.

Degree: 2014, University of Melbourne

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

► Both *treewidth* and the Hadwiger number are key *graph* parameters in structural and algorithmic *graph* *theory*, especially in the *theory* of *graph* minors. For example,…
(more)

Subjects/Keywords: graph theory; treewidth; parameters tied to treewidth; line graphs; Kneser graphs; Erdős-Ko-Rado Theorem; graph minors; graph algorithms; Hadwiger number; Hadwiger conjecture; circular arc graphs

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Harvey, D. J. (2014). On Treewidth and Graph Minors. (Doctoral Dissertation). University of Melbourne. Retrieved from http://hdl.handle.net/11343/40752

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

Harvey, Daniel John. “On Treewidth and Graph Minors.” 2014. Doctoral Dissertation, University of Melbourne. Accessed January 19, 2021. http://hdl.handle.net/11343/40752.

MLA Handbook (7^{th} Edition):

Harvey, Daniel John. “On Treewidth and Graph Minors.” 2014. Web. 19 Jan 2021.

Vancouver:

Harvey DJ. On Treewidth and Graph Minors. [Internet] [Doctoral dissertation]. University of Melbourne; 2014. [cited 2021 Jan 19]. Available from: http://hdl.handle.net/11343/40752.

Council of Science Editors:

Harvey DJ. On Treewidth and Graph Minors. [Doctoral Dissertation]. University of Melbourne; 2014. Available from: http://hdl.handle.net/11343/40752

University of Minnesota

5.
Stewart, Danielle.
* Even* Harmonious Labelings of Disconnected

Degree: MS, Applied and Computational Mathematics, 2015, University of Minnesota

URL: http://hdl.handle.net/11299/174719

► A *graph* G with q edges is called it{graceful} if there is an injection from the vertices of G to the set {0,1,…,q} such that…
(more)

Subjects/Keywords: Disconnected Graphs; Even Harmonious; Graph Labeling; Graph Theory; Harmonious; Properly Even Harmonious

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Stewart, D. (2015). Even Harmonious Labelings of Disconnected Graphs. (Masters Thesis). University of Minnesota. Retrieved from http://hdl.handle.net/11299/174719

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

Stewart, Danielle. “Even Harmonious Labelings of Disconnected Graphs.” 2015. Masters Thesis, University of Minnesota. Accessed January 19, 2021. http://hdl.handle.net/11299/174719.

MLA Handbook (7^{th} Edition):

Stewart, Danielle. “Even Harmonious Labelings of Disconnected Graphs.” 2015. Web. 19 Jan 2021.

Vancouver:

Stewart D. Even Harmonious Labelings of Disconnected Graphs. [Internet] [Masters thesis]. University of Minnesota; 2015. [cited 2021 Jan 19]. Available from: http://hdl.handle.net/11299/174719.

Council of Science Editors:

Stewart D. Even Harmonious Labelings of Disconnected Graphs. [Masters Thesis]. University of Minnesota; 2015. Available from: http://hdl.handle.net/11299/174719

Vanderbilt University

6.
Marshall, Emily Abernethy.
Hamiltonicity and Structure of Classes of Minor-*Free* *Graphs*.

Degree: PhD, Mathematics, 2014, Vanderbilt University

URL: http://hdl.handle.net/1803/10999

► The main results of this dissertation are Hamiltonicity and structural results for *graphs* on surfaces and *graphs* with certain forbidden minors. The first result is…
(more)

Subjects/Keywords: minor-free graphs; hamilton cycles; graph theory

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Marshall, E. A. (2014). Hamiltonicity and Structure of Classes of Minor-Free Graphs. (Doctoral Dissertation). Vanderbilt University. Retrieved from http://hdl.handle.net/1803/10999

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

Marshall, Emily Abernethy. “Hamiltonicity and Structure of Classes of Minor-Free Graphs.” 2014. Doctoral Dissertation, Vanderbilt University. Accessed January 19, 2021. http://hdl.handle.net/1803/10999.

MLA Handbook (7^{th} Edition):

Marshall, Emily Abernethy. “Hamiltonicity and Structure of Classes of Minor-Free Graphs.” 2014. Web. 19 Jan 2021.

Vancouver:

Marshall EA. Hamiltonicity and Structure of Classes of Minor-Free Graphs. [Internet] [Doctoral dissertation]. Vanderbilt University; 2014. [cited 2021 Jan 19]. Available from: http://hdl.handle.net/1803/10999.

Council of Science Editors:

Marshall EA. Hamiltonicity and Structure of Classes of Minor-Free Graphs. [Doctoral Dissertation]. Vanderbilt University; 2014. Available from: http://hdl.handle.net/1803/10999

University of Waterloo

7.
Wittnebel, John.
Bounds on Maximum Matchings in 1-*Planar* *Graphs*.

Degree: 2019, University of Waterloo

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

► In this thesis, we study lower bounds on maximum matchings in 1-*planar* *graphs*. We expand upon the tools used for proofs of matching bounds in…
(more)

Subjects/Keywords: Graph Matchings; 1-Planar Graphs

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Wittnebel, J. (2019). Bounds on Maximum Matchings in 1-Planar Graphs. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/14445

Not specified: Masters Thesis or Doctoral Dissertation

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

Wittnebel, John. “Bounds on Maximum Matchings in 1-Planar Graphs.” 2019. Thesis, University of Waterloo. Accessed January 19, 2021. http://hdl.handle.net/10012/14445.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Wittnebel, John. “Bounds on Maximum Matchings in 1-Planar Graphs.” 2019. Web. 19 Jan 2021.

Vancouver:

Wittnebel J. Bounds on Maximum Matchings in 1-Planar Graphs. [Internet] [Thesis]. University of Waterloo; 2019. [cited 2021 Jan 19]. Available from: http://hdl.handle.net/10012/14445.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Wittnebel J. Bounds on Maximum Matchings in 1-Planar Graphs. [Thesis]. University of Waterloo; 2019. Available from: http://hdl.handle.net/10012/14445

Not specified: Masters Thesis or Doctoral Dissertation

Indian Institute of Science

8.
Basavaraju, Manu.
Acyclic Edge Coloring Of *Graphs*.

Degree: PhD, Faculty of Engineering, 2013, Indian Institute of Science

URL: http://etd.iisc.ac.in/handle/2005/2263

► A proper edge coloring of G =(V,E)is a map c : E → C (where C is the set of available colors ) with c(e)…
(more)

Subjects/Keywords: Graph - Coloring; Graph Theory; Graphs - Acyclic Edge Coloring; Subcubic Graphs; 2-Degenerate Graphs; Planar Graphs; Acyclic Edge Coloring; Dense Graphs; Graph Theory

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Basavaraju, M. (2013). Acyclic Edge Coloring Of Graphs. (Doctoral Dissertation). Indian Institute of Science. Retrieved from http://etd.iisc.ac.in/handle/2005/2263

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

Basavaraju, Manu. “Acyclic Edge Coloring Of Graphs.” 2013. Doctoral Dissertation, Indian Institute of Science. Accessed January 19, 2021. http://etd.iisc.ac.in/handle/2005/2263.

MLA Handbook (7^{th} Edition):

Basavaraju, Manu. “Acyclic Edge Coloring Of Graphs.” 2013. Web. 19 Jan 2021.

Vancouver:

Basavaraju M. Acyclic Edge Coloring Of Graphs. [Internet] [Doctoral dissertation]. Indian Institute of Science; 2013. [cited 2021 Jan 19]. Available from: http://etd.iisc.ac.in/handle/2005/2263.

Council of Science Editors:

Basavaraju M. Acyclic Edge Coloring Of Graphs. [Doctoral Dissertation]. Indian Institute of Science; 2013. Available from: http://etd.iisc.ac.in/handle/2005/2263

9.
Le, Ngoc Khang.
Detecting and Coloring some *Graph* Classes : Détection et coloration de certaines classes de graphes.

Degree: Docteur es, Informatique, 2018, Lyon

URL: http://www.theses.fr/2018LYSEN021

►

Les graphes sont des structures mathématiques utilisées pour modéliser les relations par paires entre objets. Malgré leur structure simple, les graphes ont des applications dans… (more)

Subjects/Keywords: Coloration de graphe; Reconnaissance de graphe; Sous-graphes induits; Graphes sans ISK4; Graphes sans trou pair; Coloration gloutonne connexe; Graph coloring; Graph recognition; Induced subgraphs; ISK4-free graphs; Even-hole-free graphs; Connected greedy coloring

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Le, N. K. (2018). Detecting and Coloring some Graph Classes : Détection et coloration de certaines classes de graphes. (Doctoral Dissertation). Lyon. Retrieved from http://www.theses.fr/2018LYSEN021

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

Le, Ngoc Khang. “Detecting and Coloring some Graph Classes : Détection et coloration de certaines classes de graphes.” 2018. Doctoral Dissertation, Lyon. Accessed January 19, 2021. http://www.theses.fr/2018LYSEN021.

MLA Handbook (7^{th} Edition):

Le, Ngoc Khang. “Detecting and Coloring some Graph Classes : Détection et coloration de certaines classes de graphes.” 2018. Web. 19 Jan 2021.

Vancouver:

Le NK. Detecting and Coloring some Graph Classes : Détection et coloration de certaines classes de graphes. [Internet] [Doctoral dissertation]. Lyon; 2018. [cited 2021 Jan 19]. Available from: http://www.theses.fr/2018LYSEN021.

Council of Science Editors:

Le NK. Detecting and Coloring some Graph Classes : Détection et coloration de certaines classes de graphes. [Doctoral Dissertation]. Lyon; 2018. Available from: http://www.theses.fr/2018LYSEN021

Iowa State University

10.
Lastrina, Michelle Anne.
List-coloring and sum-list-coloring problems on *graphs*.

Degree: 2012, Iowa State University

URL: https://lib.dr.iastate.edu/etd/12376

► *Graph* coloring is a well-known and well-studied area of *graph* *theory* that has many applications. In this dissertation, we look at two generalizations of *graph*…
(more)

Subjects/Keywords: choosability; Graph theory; list-coloring; planar graphs; sum-list-coloring; Mathematics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Lastrina, M. A. (2012). List-coloring and sum-list-coloring problems on graphs. (Thesis). Iowa State University. Retrieved from https://lib.dr.iastate.edu/etd/12376

Not specified: Masters Thesis or Doctoral Dissertation

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

Lastrina, Michelle Anne. “List-coloring and sum-list-coloring problems on graphs.” 2012. Thesis, Iowa State University. Accessed January 19, 2021. https://lib.dr.iastate.edu/etd/12376.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Lastrina, Michelle Anne. “List-coloring and sum-list-coloring problems on graphs.” 2012. Web. 19 Jan 2021.

Vancouver:

Lastrina MA. List-coloring and sum-list-coloring problems on graphs. [Internet] [Thesis]. Iowa State University; 2012. [cited 2021 Jan 19]. Available from: https://lib.dr.iastate.edu/etd/12376.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Lastrina MA. List-coloring and sum-list-coloring problems on graphs. [Thesis]. Iowa State University; 2012. Available from: https://lib.dr.iastate.edu/etd/12376

Not specified: Masters Thesis or Doctoral Dissertation

University of Windsor

11.
Khanduja, Sudiksha.
Weakly Chordal * Graphs*: An Experimental Study.

Degree: MS, Computer Science, 2020, University of Windsor

URL: https://scholar.uwindsor.ca/etd/8377

► *Graph* *theory* is an important field that enables one to get general ideas about *graphs* and their properties. There are many situations (such as generating…
(more)

Subjects/Keywords: Antihole; Generation Algorithm; Graph Theory; Hole; Weakly Chordal Graphs

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Khanduja, S. (2020). Weakly Chordal Graphs: An Experimental Study. (Masters Thesis). University of Windsor. Retrieved from https://scholar.uwindsor.ca/etd/8377

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

Khanduja, Sudiksha. “Weakly Chordal Graphs: An Experimental Study.” 2020. Masters Thesis, University of Windsor. Accessed January 19, 2021. https://scholar.uwindsor.ca/etd/8377.

MLA Handbook (7^{th} Edition):

Khanduja, Sudiksha. “Weakly Chordal Graphs: An Experimental Study.” 2020. Web. 19 Jan 2021.

Vancouver:

Khanduja S. Weakly Chordal Graphs: An Experimental Study. [Internet] [Masters thesis]. University of Windsor; 2020. [cited 2021 Jan 19]. Available from: https://scholar.uwindsor.ca/etd/8377.

Council of Science Editors:

Khanduja S. Weakly Chordal Graphs: An Experimental Study. [Masters Thesis]. University of Windsor; 2020. Available from: https://scholar.uwindsor.ca/etd/8377

Indian Institute of Science

12.
Goyal, Prachi.
Parameterized Complexity of Maximum Edge Coloring in *Graphs*.

Degree: MSc Engg, Faculty of Engineering, 2018, Indian Institute of Science

URL: http://etd.iisc.ac.in/handle/2005/3255

► The classical *graph* edge coloring problem deals in coloring the edges of a given *graph* with minimum number of colors such that no two adjacent…
(more)

Subjects/Keywords: Graph Theory; Graphs; Graphs - Coloring; Parameterized Complexity; Maximum Edge Coloring (Graphs); Fixed Parameter Tractable Algorithms; Kernelization; Graph Edge Coloring; FPT Algorithm; Polynomial Kernel; C4-free Graphs; Computer Science

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Goyal, P. (2018). Parameterized Complexity of Maximum Edge Coloring in Graphs. (Masters Thesis). Indian Institute of Science. Retrieved from http://etd.iisc.ac.in/handle/2005/3255

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

Goyal, Prachi. “Parameterized Complexity of Maximum Edge Coloring in Graphs.” 2018. Masters Thesis, Indian Institute of Science. Accessed January 19, 2021. http://etd.iisc.ac.in/handle/2005/3255.

MLA Handbook (7^{th} Edition):

Goyal, Prachi. “Parameterized Complexity of Maximum Edge Coloring in Graphs.” 2018. Web. 19 Jan 2021.

Vancouver:

Goyal P. Parameterized Complexity of Maximum Edge Coloring in Graphs. [Internet] [Masters thesis]. Indian Institute of Science; 2018. [cited 2021 Jan 19]. Available from: http://etd.iisc.ac.in/handle/2005/3255.

Council of Science Editors:

Goyal P. Parameterized Complexity of Maximum Edge Coloring in Graphs. [Masters Thesis]. Indian Institute of Science; 2018. Available from: http://etd.iisc.ac.in/handle/2005/3255

13.
Mozes, Shay.
Efficient Algorithms for Shortest-Path and Maximum-Flow
Problems in *Planar* *Graphs*.

Degree: PhD, Computer Science, 2013, Brown University

URL: https://repository.library.brown.edu/studio/item/bdr:320482/

► Large *graphs* are ubiquitous in many diverse fields ranging from sociology and economics to biology and engineering. Applications in numerous areas such as transportation, geographical…
(more)

Subjects/Keywords: planar graphs

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Mozes, S. (2013). Efficient Algorithms for Shortest-Path and Maximum-Flow Problems in Planar Graphs. (Doctoral Dissertation). Brown University. Retrieved from https://repository.library.brown.edu/studio/item/bdr:320482/

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

Mozes, Shay. “Efficient Algorithms for Shortest-Path and Maximum-Flow Problems in Planar Graphs.” 2013. Doctoral Dissertation, Brown University. Accessed January 19, 2021. https://repository.library.brown.edu/studio/item/bdr:320482/.

MLA Handbook (7^{th} Edition):

Mozes, Shay. “Efficient Algorithms for Shortest-Path and Maximum-Flow Problems in Planar Graphs.” 2013. Web. 19 Jan 2021.

Vancouver:

Mozes S. Efficient Algorithms for Shortest-Path and Maximum-Flow Problems in Planar Graphs. [Internet] [Doctoral dissertation]. Brown University; 2013. [cited 2021 Jan 19]. Available from: https://repository.library.brown.edu/studio/item/bdr:320482/.

Council of Science Editors:

Mozes S. Efficient Algorithms for Shortest-Path and Maximum-Flow Problems in Planar Graphs. [Doctoral Dissertation]. Brown University; 2013. Available from: https://repository.library.brown.edu/studio/item/bdr:320482/

University of Newcastle

14. Marshall, Kim. Extremal networks and connectivity.

Degree: PhD, 2011, University of Newcastle

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

►

Research Doctorate - Doctor of Philosophy (PhD)

In this thesis we consider questions in two separate but related research areas in the field of *graph*…
(more)

Subjects/Keywords: extremal graphs; connectivity; graph theory

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Marshall, K. (2011). Extremal networks and connectivity. (Doctoral Dissertation). University of Newcastle. Retrieved from http://hdl.handle.net/1959.13/927974

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

Marshall, Kim. “Extremal networks and connectivity.” 2011. Doctoral Dissertation, University of Newcastle. Accessed January 19, 2021. http://hdl.handle.net/1959.13/927974.

MLA Handbook (7^{th} Edition):

Marshall, Kim. “Extremal networks and connectivity.” 2011. Web. 19 Jan 2021.

Vancouver:

Marshall K. Extremal networks and connectivity. [Internet] [Doctoral dissertation]. University of Newcastle; 2011. [cited 2021 Jan 19]. Available from: http://hdl.handle.net/1959.13/927974.

Council of Science Editors:

Marshall K. Extremal networks and connectivity. [Doctoral Dissertation]. University of Newcastle; 2011. Available from: http://hdl.handle.net/1959.13/927974

15.
Plaisted, Daniel.
On a *graph* parameter related to vertex labelings and its application to minimum rank problems in *graph* * theory*.

Degree: 2019, University of Tennessee – Chattanooga

URL: https://scholar.utc.edu/theses/611

► This thesis regards the minimum rank and minimum positive semidefinite rank of a simple *graph*. A *graph* parameter, called the minimum labeling degree (mld), is…
(more)

Subjects/Keywords: Graph theory; Representations of graphs

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Plaisted, D. (2019). On a graph parameter related to vertex labelings and its application to minimum rank problems in graph theory. (Masters Thesis). University of Tennessee – Chattanooga. Retrieved from https://scholar.utc.edu/theses/611

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

Plaisted, Daniel. “On a graph parameter related to vertex labelings and its application to minimum rank problems in graph theory.” 2019. Masters Thesis, University of Tennessee – Chattanooga. Accessed January 19, 2021. https://scholar.utc.edu/theses/611.

MLA Handbook (7^{th} Edition):

Plaisted, Daniel. “On a graph parameter related to vertex labelings and its application to minimum rank problems in graph theory.” 2019. Web. 19 Jan 2021.

Vancouver:

Plaisted D. On a graph parameter related to vertex labelings and its application to minimum rank problems in graph theory. [Internet] [Masters thesis]. University of Tennessee – Chattanooga; 2019. [cited 2021 Jan 19]. Available from: https://scholar.utc.edu/theses/611.

Council of Science Editors:

Plaisted D. On a graph parameter related to vertex labelings and its application to minimum rank problems in graph theory. [Masters Thesis]. University of Tennessee – Chattanooga; 2019. Available from: https://scholar.utc.edu/theses/611

16.
Christopher, Jeffrey.
Induced path number for the complementary prism of a grid * graph*.

Degree: 2019, University of Tennessee – Chattanooga

URL: https://scholar.utc.edu/theses/594

► The induced path number rho(G) of a *graph* G is defined as the minimum number of subsets into which the vertex set of G can…
(more)

Subjects/Keywords: Graph theory; Directed graphs

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Christopher, J. (2019). Induced path number for the complementary prism of a grid graph. (Masters Thesis). University of Tennessee – Chattanooga. Retrieved from https://scholar.utc.edu/theses/594

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

Christopher, Jeffrey. “Induced path number for the complementary prism of a grid graph.” 2019. Masters Thesis, University of Tennessee – Chattanooga. Accessed January 19, 2021. https://scholar.utc.edu/theses/594.

MLA Handbook (7^{th} Edition):

Christopher, Jeffrey. “Induced path number for the complementary prism of a grid graph.” 2019. Web. 19 Jan 2021.

Vancouver:

Christopher J. Induced path number for the complementary prism of a grid graph. [Internet] [Masters thesis]. University of Tennessee – Chattanooga; 2019. [cited 2021 Jan 19]. Available from: https://scholar.utc.edu/theses/594.

Council of Science Editors:

Christopher J. Induced path number for the complementary prism of a grid graph. [Masters Thesis]. University of Tennessee – Chattanooga; 2019. Available from: https://scholar.utc.edu/theses/594

University of Victoria

17. Young, Kailyn M. 2-dipath and proper 2-dipath k-colourings: Two-dipath and proper two-dipath k-colourings.

Degree: Dept. of Mathematics and Statistics, 2011, University of Victoria

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

► A 2-dipath k-colouring of an oriented *graph* G is an assignment of k colours, 1,2, . . . , k, to the vertices of G…
(more)

Subjects/Keywords: graph theory; oriented graphs; tournaments

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Young, K. M. (2011). 2-dipath and proper 2-dipath k-colourings: Two-dipath and proper two-dipath k-colourings. (Masters Thesis). University of Victoria. Retrieved from http://hdl.handle.net/1828/3277

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

Young, Kailyn M. “2-dipath and proper 2-dipath k-colourings: Two-dipath and proper two-dipath k-colourings.” 2011. Masters Thesis, University of Victoria. Accessed January 19, 2021. http://hdl.handle.net/1828/3277.

MLA Handbook (7^{th} Edition):

Young, Kailyn M. “2-dipath and proper 2-dipath k-colourings: Two-dipath and proper two-dipath k-colourings.” 2011. Web. 19 Jan 2021.

Vancouver:

Young KM. 2-dipath and proper 2-dipath k-colourings: Two-dipath and proper two-dipath k-colourings. [Internet] [Masters thesis]. University of Victoria; 2011. [cited 2021 Jan 19]. Available from: http://hdl.handle.net/1828/3277.

Council of Science Editors:

Young KM. 2-dipath and proper 2-dipath k-colourings: Two-dipath and proper two-dipath k-colourings. [Masters Thesis]. University of Victoria; 2011. Available from: http://hdl.handle.net/1828/3277

18.
Jampani, Krishnam Raju.
Simultaneous *Graph* Representation Problems.

Degree: 2011, University of Waterloo

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

► Many *graphs* arising in practice can be represented in a concise and intuitive way that conveys their structure. For example: A *planar* *graph* can be…
(more)

Subjects/Keywords: Graph Theory; Graph Algorithms; Simultaneous Representation; Planar Graphs; Interval Graphs; Comparability Graphs; Chordal Graphs; Permutation Graphs; Sandwich Graphs; Probe Graphs

…theorems in *graph*
*theory* involve *planar* *graphs*. For example Euler’s formula connecting the number… …*planar* *graphs* (the *graph*
formed by the edges and vertices of three-dimensional convex… …*graphs*. F´
ary’s theorem [54] states that
any *planar* *graph* can be drawn with non… …adjacent in the *graph* if and only if their corresponding disks touch each
other. *Planar* *graphs*… …related
*planar* *graphs* and have applications in *graph* visualization and *graph* drawing, for…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Jampani, K. R. (2011). Simultaneous Graph Representation Problems. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/5793

Not specified: Masters Thesis or Doctoral Dissertation

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

Jampani, Krishnam Raju. “Simultaneous Graph Representation Problems.” 2011. Thesis, University of Waterloo. Accessed January 19, 2021. http://hdl.handle.net/10012/5793.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Jampani, Krishnam Raju. “Simultaneous Graph Representation Problems.” 2011. Web. 19 Jan 2021.

Vancouver:

Jampani KR. Simultaneous Graph Representation Problems. [Internet] [Thesis]. University of Waterloo; 2011. [cited 2021 Jan 19]. Available from: http://hdl.handle.net/10012/5793.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Jampani KR. Simultaneous Graph Representation Problems. [Thesis]. University of Waterloo; 2011. Available from: http://hdl.handle.net/10012/5793

Not specified: Masters Thesis or Doctoral Dissertation

Ryerson University

19. 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 January 19, 2021. 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. 19 Jan 2021.

Vancouver:

Patel S. Clique Listing Algorithms and Characteristics of Cliques in Random Graphics. [Internet] [Thesis]. Ryerson University; 2010. [cited 2021 Jan 19]. 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

Univerzitet u Beogradu

20. Mihailović, Bojana Lj., 1960-. Neke klase grafova sa datim ograničenjima druge sopstvene vrednosti.

Degree: Matematički fakultet, 2018, Univerzitet u Beogradu

URL: https://fedorabg.bg.ac.rs/fedora/get/o:15171/bdef:Content/get

►

Matematika - Spektralna teorija grafova / Mathematics - Spectral *graph* *theory*

Predmet ove disertacije pripada oblasti spektralne teorije grafova, mladoj grani matematičke kombinatorike, odnosno teorije… (more)

Subjects/Keywords: spectral graph theory; second largest eigenvalue; hereditary graph property; maximal graphs; minimal forbidden graphs; treelike graphs (cacti); reflexive graphs

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Mihailović, Bojana Lj., 1. (2018). Neke klase grafova sa datim ograničenjima druge sopstvene vrednosti. (Thesis). Univerzitet u Beogradu. Retrieved from https://fedorabg.bg.ac.rs/fedora/get/o:15171/bdef:Content/get

Not specified: Masters Thesis or Doctoral Dissertation

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

Mihailović, Bojana Lj., 1960-. “Neke klase grafova sa datim ograničenjima druge sopstvene vrednosti.” 2018. Thesis, Univerzitet u Beogradu. Accessed January 19, 2021. https://fedorabg.bg.ac.rs/fedora/get/o:15171/bdef:Content/get.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Mihailović, Bojana Lj., 1960-. “Neke klase grafova sa datim ograničenjima druge sopstvene vrednosti.” 2018. Web. 19 Jan 2021.

Vancouver:

Mihailović, Bojana Lj. 1. Neke klase grafova sa datim ograničenjima druge sopstvene vrednosti. [Internet] [Thesis]. Univerzitet u Beogradu; 2018. [cited 2021 Jan 19]. Available from: https://fedorabg.bg.ac.rs/fedora/get/o:15171/bdef:Content/get.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Mihailović, Bojana Lj. 1. Neke klase grafova sa datim ograničenjima druge sopstvene vrednosti. [Thesis]. Univerzitet u Beogradu; 2018. Available from: https://fedorabg.bg.ac.rs/fedora/get/o:15171/bdef:Content/get

Not specified: Masters Thesis or Doctoral Dissertation

Georgia Tech

21.
Xie, Shijie.
6-connected * graphs* are two-three linked.

Degree: PhD, Mathematics, 2019, Georgia Tech

URL: http://hdl.handle.net/1853/62273

► Let G be a *graph* and a_{0}, a_{1}, a_{2}, b_{1}, and b_{2} be distinct vertices of G. Motivated by their work on Four Color Theorem,…
(more)

Subjects/Keywords: Graph theory; Disjoint paths in graphs; Two-three linked graphs; 6-connected graphs

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Xie, S. (2019). 6-connected graphs are two-three linked. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/62273

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

Xie, Shijie. “6-connected graphs are two-three linked.” 2019. Doctoral Dissertation, Georgia Tech. Accessed January 19, 2021. http://hdl.handle.net/1853/62273.

MLA Handbook (7^{th} Edition):

Xie, Shijie. “6-connected graphs are two-three linked.” 2019. Web. 19 Jan 2021.

Vancouver:

Xie S. 6-connected graphs are two-three linked. [Internet] [Doctoral dissertation]. Georgia Tech; 2019. [cited 2021 Jan 19]. Available from: http://hdl.handle.net/1853/62273.

Council of Science Editors:

Xie S. 6-connected graphs are two-three linked. [Doctoral Dissertation]. Georgia Tech; 2019. Available from: http://hdl.handle.net/1853/62273

22.
Ferreri, Susanna.
Acyclic 5-Choosability of *Planar* * Graphs* Without Adjacent Short Cycles
.

Degree: Department of Mathematics, 2013, Brock University

URL: http://hdl.handle.net/10464/4957

► The conjecture claiming that every *planar* *graph* is acyclic 5-choosable[Borodin et al., 2002] has been verified for several restricted classes of planargraphs. Recently, O. V.…
(more)

Subjects/Keywords: Graph Theory; planar graphs; choosability; acyclic

…Chapter
1
Introduction
*Graph* *theory* is the study of *graphs*, which are structures which… …and proved that every *planar*
*graph* is acyclically 9-colourable (a *planar* *graph* is a… …this
time, conjectured that every *planar* *graph* has an acyclic 5-colouring. He
provided an… …example of a *planar* *graph* which is not acyclically 4-colourable
(refer to Figure 1.1)… …that 5 is the best
bound, there are bipartite 2-degenerate *planar* *graphs* that are not…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Ferreri, S. (2013). Acyclic 5-Choosability of Planar Graphs Without Adjacent Short Cycles . (Thesis). Brock University. Retrieved from http://hdl.handle.net/10464/4957

Not specified: Masters Thesis or Doctoral Dissertation

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

Ferreri, Susanna. “Acyclic 5-Choosability of Planar Graphs Without Adjacent Short Cycles .” 2013. Thesis, Brock University. Accessed January 19, 2021. http://hdl.handle.net/10464/4957.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Ferreri, Susanna. “Acyclic 5-Choosability of Planar Graphs Without Adjacent Short Cycles .” 2013. Web. 19 Jan 2021.

Vancouver:

Ferreri S. Acyclic 5-Choosability of Planar Graphs Without Adjacent Short Cycles . [Internet] [Thesis]. Brock University; 2013. [cited 2021 Jan 19]. Available from: http://hdl.handle.net/10464/4957.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Ferreri S. Acyclic 5-Choosability of Planar Graphs Without Adjacent Short Cycles . [Thesis]. Brock University; 2013. Available from: http://hdl.handle.net/10464/4957

Not specified: Masters Thesis or Doctoral Dissertation

University of Waterloo

23. Barrera-Cruz, Fidel. On Schnyder's Theorm.

Degree: 2010, University of Waterloo

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

► The central topic of this thesis is Schnyder's Theorem. Schnyder's Theorem provides a characterization of *planar* *graphs* in terms of their poset dimension, as follows:…
(more)

Subjects/Keywords: Graph theory; Simplicial complexes; Planar graphs; Poset dimension

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Barrera-Cruz, F. (2010). On Schnyder's Theorm. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/5358

Not specified: Masters Thesis or Doctoral Dissertation

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

Barrera-Cruz, Fidel. “On Schnyder's Theorm.” 2010. Thesis, University of Waterloo. Accessed January 19, 2021. http://hdl.handle.net/10012/5358.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Barrera-Cruz, Fidel. “On Schnyder's Theorm.” 2010. Web. 19 Jan 2021.

Vancouver:

Barrera-Cruz F. On Schnyder's Theorm. [Internet] [Thesis]. University of Waterloo; 2010. [cited 2021 Jan 19]. Available from: http://hdl.handle.net/10012/5358.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Barrera-Cruz F. On Schnyder's Theorm. [Thesis]. University of Waterloo; 2010. Available from: http://hdl.handle.net/10012/5358

Not specified: Masters Thesis or Doctoral Dissertation

University of Missouri – Columbia

24. Granger, Valerie, 1985-. GIT-equivalence and semi-stable subcategories of quiver representations.

Degree: 2016, University of Missouri – Columbia

URL: https://doi.org/10.32469/10355/56527

► The main investigation in this thesis is to determine when two weights give rise to the same semi-stable subcategory in the case of representations of…
(more)

Subjects/Keywords: Directed graphs; Representations of graphs; Paths and cycles (Graph theory)

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Granger, Valerie, 1. (2016). GIT-equivalence and semi-stable subcategories of quiver representations. (Thesis). University of Missouri – Columbia. Retrieved from https://doi.org/10.32469/10355/56527

Not specified: Masters Thesis or Doctoral Dissertation

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

Granger, Valerie, 1985-. “GIT-equivalence and semi-stable subcategories of quiver representations.” 2016. Thesis, University of Missouri – Columbia. Accessed January 19, 2021. https://doi.org/10.32469/10355/56527.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Granger, Valerie, 1985-. “GIT-equivalence and semi-stable subcategories of quiver representations.” 2016. Web. 19 Jan 2021.

Vancouver:

Granger, Valerie 1. GIT-equivalence and semi-stable subcategories of quiver representations. [Internet] [Thesis]. University of Missouri – Columbia; 2016. [cited 2021 Jan 19]. Available from: https://doi.org/10.32469/10355/56527.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Granger, Valerie 1. GIT-equivalence and semi-stable subcategories of quiver representations. [Thesis]. University of Missouri – Columbia; 2016. Available from: https://doi.org/10.32469/10355/56527

Not specified: Masters Thesis or Doctoral Dissertation

California State University – San Bernardino

25.
Hearon, Sean M.
*PLANAR** GRAPHS*, BIPLANAR

Degree: MAin Mathematics, Mathematics, 2016, California State University – San Bernardino

URL: https://scholarworks.lib.csusb.edu/etd/427

► A *graph* is *planar* if it can be drawn on a piece of paper such that no two edges cross. The smallest complete and…
(more)

Subjects/Keywords: Graphs; Combinatorics; Planar; Biplanar; Graph thickness; Discrete Mathematics and Combinatorics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Hearon, S. M. (2016). PLANAR GRAPHS, BIPLANAR GRAPHS AND GRAPH THICKNESS. (Thesis). California State University – San Bernardino. Retrieved from https://scholarworks.lib.csusb.edu/etd/427

Not specified: Masters Thesis or Doctoral Dissertation

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

Hearon, Sean M. “PLANAR GRAPHS, BIPLANAR GRAPHS AND GRAPH THICKNESS.” 2016. Thesis, California State University – San Bernardino. Accessed January 19, 2021. https://scholarworks.lib.csusb.edu/etd/427.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Hearon, Sean M. “PLANAR GRAPHS, BIPLANAR GRAPHS AND GRAPH THICKNESS.” 2016. Web. 19 Jan 2021.

Vancouver:

Hearon SM. PLANAR GRAPHS, BIPLANAR GRAPHS AND GRAPH THICKNESS. [Internet] [Thesis]. California State University – San Bernardino; 2016. [cited 2021 Jan 19]. Available from: https://scholarworks.lib.csusb.edu/etd/427.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Hearon SM. PLANAR GRAPHS, BIPLANAR GRAPHS AND GRAPH THICKNESS. [Thesis]. California State University – San Bernardino; 2016. Available from: https://scholarworks.lib.csusb.edu/etd/427

Not specified: Masters Thesis or Doctoral Dissertation

Clemson University

26.
Chauhan, Varsha.
*Planar**Graph* Generation with Application to Water Distribution Networks.

Degree: MS, School of Computing, 2018, Clemson University

URL: https://tigerprints.clemson.edu/all_theses/2975

► The study of network representations of physical, biological, and social phenomena can help us better understand their structure and functional dynamics as well as formulate…
(more)

Subjects/Keywords: Multiscale Graph generation; Planar Graphs; Water Distribution System Optimization; Water Networks

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Chauhan, V. (2018). Planar Graph Generation with Application to Water Distribution Networks. (Masters Thesis). Clemson University. Retrieved from https://tigerprints.clemson.edu/all_theses/2975

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

Chauhan, Varsha. “Planar Graph Generation with Application to Water Distribution Networks.” 2018. Masters Thesis, Clemson University. Accessed January 19, 2021. https://tigerprints.clemson.edu/all_theses/2975.

MLA Handbook (7^{th} Edition):

Chauhan, Varsha. “Planar Graph Generation with Application to Water Distribution Networks.” 2018. Web. 19 Jan 2021.

Vancouver:

Chauhan V. Planar Graph Generation with Application to Water Distribution Networks. [Internet] [Masters thesis]. Clemson University; 2018. [cited 2021 Jan 19]. Available from: https://tigerprints.clemson.edu/all_theses/2975.

Council of Science Editors:

Chauhan V. Planar Graph Generation with Application to Water Distribution Networks. [Masters Thesis]. Clemson University; 2018. Available from: https://tigerprints.clemson.edu/all_theses/2975

University of Alberta

27.
Enright, Jessica Anne.
Results on Set Representations of *Graphs*.

Degree: PhD, Department of Computing Science, 2011, University of Alberta

URL: https://era.library.ualberta.ca/files/41687k094

► A set representation of a *graph* is an assignment of sets to vertices such that two vertices are adjacent if and only if their assigned…
(more)

Subjects/Keywords: intersection graphs; combinatorial games; graph theory

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Enright, J. A. (2011). Results on Set Representations of Graphs. (Doctoral Dissertation). University of Alberta. Retrieved from https://era.library.ualberta.ca/files/41687k094

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

Enright, Jessica Anne. “Results on Set Representations of Graphs.” 2011. Doctoral Dissertation, University of Alberta. Accessed January 19, 2021. https://era.library.ualberta.ca/files/41687k094.

MLA Handbook (7^{th} Edition):

Enright, Jessica Anne. “Results on Set Representations of Graphs.” 2011. Web. 19 Jan 2021.

Vancouver:

Enright JA. Results on Set Representations of Graphs. [Internet] [Doctoral dissertation]. University of Alberta; 2011. [cited 2021 Jan 19]. Available from: https://era.library.ualberta.ca/files/41687k094.

Council of Science Editors:

Enright JA. Results on Set Representations of Graphs. [Doctoral Dissertation]. University of Alberta; 2011. Available from: https://era.library.ualberta.ca/files/41687k094

University of Waterloo

28.
Sato, Cristiane Maria.
Core Structures in Random * Graphs* and Hypergraphs.

Degree: 2013, University of Waterloo

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

► The k-core of a *graph* is its maximal subgraph with minimum degree at least k. The study of k-cores in random *graphs* was initiated by…
(more)

Subjects/Keywords: combinatorics; graph theory; random graphs; probabilistic; enumeration

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Sato, C. M. (2013). Core Structures in Random Graphs and Hypergraphs. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/7787

Not specified: Masters Thesis or Doctoral Dissertation

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

Sato, Cristiane Maria. “Core Structures in Random Graphs and Hypergraphs.” 2013. Thesis, University of Waterloo. Accessed January 19, 2021. http://hdl.handle.net/10012/7787.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Sato, Cristiane Maria. “Core Structures in Random Graphs and Hypergraphs.” 2013. Web. 19 Jan 2021.

Vancouver:

Sato CM. Core Structures in Random Graphs and Hypergraphs. [Internet] [Thesis]. University of Waterloo; 2013. [cited 2021 Jan 19]. Available from: http://hdl.handle.net/10012/7787.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Sato CM. Core Structures in Random Graphs and Hypergraphs. [Thesis]. University of Waterloo; 2013. Available from: http://hdl.handle.net/10012/7787

Not specified: Masters Thesis or Doctoral Dissertation

Hong Kong University of Science and Technology

29. Abeynayake, Hiddadura Isura Malinda Mendis. Effectiveness of static data representation.

Degree: 2016, Hong Kong University of Science and Technology

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

► *Graphs* are a means to convey the numerical information in day to day life so that they can be seeing and understood. Effective ways to…
(more)

Subjects/Keywords: Information visualization ; Representations of graphs ; Graph theory

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Abeynayake, H. I. M. M. (2016). Effectiveness of static data representation. (Thesis). Hong Kong University of Science and Technology. Retrieved from http://repository.ust.hk/ir/Record/1783.1-80395 ; https://doi.org/10.14711/thesis-b1584484 ; http://repository.ust.hk/ir/bitstream/1783.1-80395/1/th_redirect.html

Not specified: Masters Thesis or Doctoral Dissertation

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

Abeynayake, Hiddadura Isura Malinda Mendis. “Effectiveness of static data representation.” 2016. Thesis, Hong Kong University of Science and Technology. Accessed January 19, 2021. http://repository.ust.hk/ir/Record/1783.1-80395 ; https://doi.org/10.14711/thesis-b1584484 ; http://repository.ust.hk/ir/bitstream/1783.1-80395/1/th_redirect.html.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Abeynayake, Hiddadura Isura Malinda Mendis. “Effectiveness of static data representation.” 2016. Web. 19 Jan 2021.

Vancouver:

Abeynayake HIMM. Effectiveness of static data representation. [Internet] [Thesis]. Hong Kong University of Science and Technology; 2016. [cited 2021 Jan 19]. Available from: http://repository.ust.hk/ir/Record/1783.1-80395 ; https://doi.org/10.14711/thesis-b1584484 ; http://repository.ust.hk/ir/bitstream/1783.1-80395/1/th_redirect.html.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Abeynayake HIMM. Effectiveness of static data representation. [Thesis]. Hong Kong University of Science and Technology; 2016. Available from: http://repository.ust.hk/ir/Record/1783.1-80395 ; https://doi.org/10.14711/thesis-b1584484 ; http://repository.ust.hk/ir/bitstream/1783.1-80395/1/th_redirect.html

Not specified: Masters Thesis or Doctoral Dissertation

Delft University of Technology

30.
Mahabir, Ashvant (author).
Blind *Graph* Topology Change Detection: A *Graph* Signal Processing approach.

Degree: 2017, Delft University of Technology

URL: http://resolver.tudelft.nl/uuid:9b58f037-5c2a-4444-97f4-f8dacef6eb5f

►

* Graphs* are used to model irregular data structures and serve as models to represent/capture the interrelationships between data. The data in

Subjects/Keywords: graph theory; Detection; Graphs; anomaly detection; blind

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Mahabir, A. (. (2017). Blind Graph Topology Change Detection: A Graph Signal Processing approach. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:9b58f037-5c2a-4444-97f4-f8dacef6eb5f

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

Mahabir, Ashvant (author). “Blind Graph Topology Change Detection: A Graph Signal Processing approach.” 2017. Masters Thesis, Delft University of Technology. Accessed January 19, 2021. http://resolver.tudelft.nl/uuid:9b58f037-5c2a-4444-97f4-f8dacef6eb5f.

MLA Handbook (7^{th} Edition):

Mahabir, Ashvant (author). “Blind Graph Topology Change Detection: A Graph Signal Processing approach.” 2017. Web. 19 Jan 2021.

Vancouver:

Mahabir A(. Blind Graph Topology Change Detection: A Graph Signal Processing approach. [Internet] [Masters thesis]. Delft University of Technology; 2017. [cited 2021 Jan 19]. Available from: http://resolver.tudelft.nl/uuid:9b58f037-5c2a-4444-97f4-f8dacef6eb5f.

Council of Science Editors:

Mahabir A(. Blind Graph Topology Change Detection: A Graph Signal Processing approach. [Masters Thesis]. Delft University of Technology; 2017. Available from: http://resolver.tudelft.nl/uuid:9b58f037-5c2a-4444-97f4-f8dacef6eb5f