Advanced search options

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

You searched for `subject:( coloring)`

.
Showing records 1 – 30 of
319 total matches.

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

Search Limiters

Dates

- 2016 – 2020 (106)
- 2011 – 2015 (112)
- 2006 – 2010 (62)
- 2001 – 2005 (23)

Universities

Department

- Mathematics (36)
- Informatique (34)
- 0439 (10)

Degrees

- PhD (74)
- Docteur es (46)
- MS (17)

Languages

- English (177)
- French (19)
- Portuguese (18)
- Greek (11)

▼ Search Limiters

University of Johannesburg

1. 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

►

M.Sc.

In this dissertation we study two types of colourings, namely line-distinguishing colourings and harmonious colourings. A line-distinguishing colouring of a graph G is a… (more)

Subjects/Keywords: Graph coloring

Record Details Similar Records

❌

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

APA (6^{th} 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 (16^{th} Edition):

Immelman, Yolande. “On the (upper) line-distinguishing and (upper) harmonious chromatic numbers of a graph.” 2009. Thesis, University of Johannesburg. Accessed September 29, 2020. 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 (7^{th} Edition):

Immelman, Yolande. “On the (upper) line-distinguishing and (upper) harmonious chromatic numbers of a graph.” 2009. Web. 29 Sep 2020.

Vancouver:

Immelman Y. On the (upper) line-distinguishing and (upper) harmonious chromatic numbers of a graph. [Internet] [Thesis]. University of Johannesburg; 2009. [cited 2020 Sep 29]. 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

Not specified: Masters Thesis or Doctoral Dissertation

Bowling Green State University

2. Adams, Sarah E. Chromatic Polynomials for Graphs with Split Vertices.

Degree: MA, Mathematics/Mathematics (Pure), 2020, Bowling Green State University

URL: http://rave.ohiolink.edu/etdc/view?acc_num=bgsu1593819941367146

► Graph theory is a branch of mathematics that uses graphs as a mathematical structure to model relations between objects. Graphs can be categorized in a…
(more)

Subjects/Keywords: Mathematics; chromatic polynomials; graph theory; graph coloring; fractional coloring; graph coloring

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Adams, S. E. (2020). Chromatic Polynomials for Graphs with Split Vertices. (Masters Thesis). Bowling Green State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=bgsu1593819941367146

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

Adams, Sarah E. “Chromatic Polynomials for Graphs with Split Vertices.” 2020. Masters Thesis, Bowling Green State University. Accessed September 29, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=bgsu1593819941367146.

MLA Handbook (7^{th} Edition):

Adams, Sarah E. “Chromatic Polynomials for Graphs with Split Vertices.” 2020. Web. 29 Sep 2020.

Vancouver:

Adams SE. Chromatic Polynomials for Graphs with Split Vertices. [Internet] [Masters thesis]. Bowling Green State University; 2020. [cited 2020 Sep 29]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=bgsu1593819941367146.

Council of Science Editors:

Adams SE. Chromatic Polynomials for Graphs with Split Vertices. [Masters Thesis]. Bowling Green State University; 2020. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=bgsu1593819941367146

University of Waterloo

3.
Kelly, Thomas.
Cliques, Degrees, and *Coloring*: Expanding the ω, Δ, χ paradigm.

Degree: 2019, University of Waterloo

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

► Many of the most celebrated and influential results in graph *coloring*, such as Brooks' Theorem and Vizing's Theorem, relate a graph's chromatic number to its…
(more)

Subjects/Keywords: graph coloring; list coloring; fractional coloring; probabilistic method; local version; Reed's Conjecture; clique number

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Kelly, T. (2019). Cliques, Degrees, and Coloring: Expanding the ω, Δ, χ paradigm. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/14862

Not specified: Masters Thesis or Doctoral Dissertation

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

Kelly, Thomas. “Cliques, Degrees, and Coloring: Expanding the ω, Δ, χ paradigm.” 2019. Thesis, University of Waterloo. Accessed September 29, 2020. http://hdl.handle.net/10012/14862.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Kelly, Thomas. “Cliques, Degrees, and Coloring: Expanding the ω, Δ, χ paradigm.” 2019. Web. 29 Sep 2020.

Vancouver:

Kelly T. Cliques, Degrees, and Coloring: Expanding the ω, Δ, χ paradigm. [Internet] [Thesis]. University of Waterloo; 2019. [cited 2020 Sep 29]. Available from: http://hdl.handle.net/10012/14862.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Kelly T. Cliques, Degrees, and Coloring: Expanding the ω, Δ, χ paradigm. [Thesis]. University of Waterloo; 2019. Available from: http://hdl.handle.net/10012/14862

Not specified: Masters Thesis or Doctoral Dissertation

The Ohio State University

4.
Kurt, Oguz.
On The *Coloring* of Graphs.

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

URL: http://rave.ohiolink.edu/etdc/view?acc_num=osu1262287401

► In this thesis, we consider the problem posed by Gupta, Goldberg and Seymour: “When is the chromatic index <i>¿</i>' of a graph almost the…
(more)

Subjects/Keywords: Mathematics; Graphs, Coloring; Edge Coloring; Edge Cover Coloring; Chromatc index; Cover Index

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Kurt, O. (2009). On The Coloring of Graphs. (Doctoral Dissertation). The Ohio State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=osu1262287401

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

Kurt, Oguz. “On The Coloring of Graphs.” 2009. Doctoral Dissertation, The Ohio State University. Accessed September 29, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=osu1262287401.

MLA Handbook (7^{th} Edition):

Kurt, Oguz. “On The Coloring of Graphs.” 2009. Web. 29 Sep 2020.

Vancouver:

Kurt O. On The Coloring of Graphs. [Internet] [Doctoral dissertation]. The Ohio State University; 2009. [cited 2020 Sep 29]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1262287401.

Council of Science Editors:

Kurt O. On The Coloring of Graphs. [Doctoral Dissertation]. The Ohio State University; 2009. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1262287401

University of Illinois – Urbana-Champaign

5.
Reiniger, Benjamin M.
* Coloring* and constructing (hyper)graphs with restrictions.

Degree: PhD, Mathematics, 2015, University of Illinois – Urbana-Champaign

URL: http://hdl.handle.net/2142/87975

► We consider questions regarding the existence of graphs and hypergraphs with certain *coloring* properties and other structural properties. In Chapter 2 we consider color-critical graphs…
(more)

Subjects/Keywords: graph coloring; hypergraph coloring; critical graphs; list coloring; hypergraph degrees; poset dimension

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Reiniger, B. M. (2015). Coloring and constructing (hyper)graphs with restrictions. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/87975

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

Reiniger, Benjamin M. “Coloring and constructing (hyper)graphs with restrictions.” 2015. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed September 29, 2020. http://hdl.handle.net/2142/87975.

MLA Handbook (7^{th} Edition):

Reiniger, Benjamin M. “Coloring and constructing (hyper)graphs with restrictions.” 2015. Web. 29 Sep 2020.

Vancouver:

Reiniger BM. Coloring and constructing (hyper)graphs with restrictions. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2015. [cited 2020 Sep 29]. Available from: http://hdl.handle.net/2142/87975.

Council of Science Editors:

Reiniger BM. Coloring and constructing (hyper)graphs with restrictions. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2015. Available from: http://hdl.handle.net/2142/87975

University of South Florida

6. Kerr, Jeremy William. On the Number of Colors in Quandle Knot Colorings.

Degree: 2016, University of South Florida

URL: https://scholarcommons.usf.edu/etd/6103

► A major question in Knot Theory concerns the process of trying to determine when two knots are different. A knot invariant is a quantity (number,…
(more)

Subjects/Keywords: Knot Theory; Fox Coloring; Linear Alexander Quandle Coloring; Minimal Coloring; Mathematics; Physical Sciences and Mathematics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Kerr, J. W. (2016). On the Number of Colors in Quandle Knot Colorings. (Thesis). University of South Florida. Retrieved from https://scholarcommons.usf.edu/etd/6103

Not specified: Masters Thesis or Doctoral Dissertation

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

Kerr, Jeremy William. “On the Number of Colors in Quandle Knot Colorings.” 2016. Thesis, University of South Florida. Accessed September 29, 2020. https://scholarcommons.usf.edu/etd/6103.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Kerr, Jeremy William. “On the Number of Colors in Quandle Knot Colorings.” 2016. Web. 29 Sep 2020.

Vancouver:

Kerr JW. On the Number of Colors in Quandle Knot Colorings. [Internet] [Thesis]. University of South Florida; 2016. [cited 2020 Sep 29]. Available from: https://scholarcommons.usf.edu/etd/6103.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Kerr JW. On the Number of Colors in Quandle Knot Colorings. [Thesis]. University of South Florida; 2016. Available from: https://scholarcommons.usf.edu/etd/6103

Not specified: Masters Thesis or Doctoral Dissertation

University of Hong Kong

7.
李靜文.
Various *coloring* problems
on plane graphs.

Degree: 2007, University of Hong Kong

URL: http://hdl.handle.net/10722/51869

Subjects/Keywords: Graph coloring.

Record Details Similar Records

❌

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

APA (6^{th} Edition):

李靜文. (2007). Various coloring problems on plane graphs. (Thesis). University of Hong Kong. Retrieved from http://hdl.handle.net/10722/51869

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

Author name may be incomplete

Not specified: Masters Thesis or Doctoral Dissertation

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

李靜文. “Various coloring problems on plane graphs.” 2007. Thesis, University of Hong Kong. Accessed September 29, 2020. http://hdl.handle.net/10722/51869.

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

Author name may be incomplete

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

李靜文. “Various coloring problems on plane graphs.” 2007. Web. 29 Sep 2020.

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

Author name may be incomplete

Vancouver:

李靜文. Various coloring problems on plane graphs. [Internet] [Thesis]. University of Hong Kong; 2007. [cited 2020 Sep 29]. Available from: http://hdl.handle.net/10722/51869.

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

Author name may be incomplete

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

李靜文. Various coloring problems on plane graphs. [Thesis]. University of Hong Kong; 2007. Available from: http://hdl.handle.net/10722/51869

Author name may be incomplete

Not specified: Masters Thesis or Doctoral Dissertation

Durban University of Technology

8. Sipahli, Shivon. Identification, characterization and application of a natural food colourant from Hibiscus sabdariffa.

Degree: 2017, Durban University of Technology

URL: http://hdl.handle.net/10321/2620

►

Submitted in complete fulfilment for the Degree of Master in Food Science and Technology, Durban University of Technology, 2017.

Hibiscus sabdariffa is an under-utilised plant… (more)

Subjects/Keywords: Coloring matter in food; Roselle

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Sipahli, S. (2017). Identification, characterization and application of a natural food colourant from Hibiscus sabdariffa. (Thesis). Durban University of Technology. Retrieved from http://hdl.handle.net/10321/2620

Not specified: Masters Thesis or Doctoral Dissertation

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

Sipahli, Shivon. “Identification, characterization and application of a natural food colourant from Hibiscus sabdariffa.” 2017. Thesis, Durban University of Technology. Accessed September 29, 2020. http://hdl.handle.net/10321/2620.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Sipahli, Shivon. “Identification, characterization and application of a natural food colourant from Hibiscus sabdariffa.” 2017. Web. 29 Sep 2020.

Vancouver:

Sipahli S. Identification, characterization and application of a natural food colourant from Hibiscus sabdariffa. [Internet] [Thesis]. Durban University of Technology; 2017. [cited 2020 Sep 29]. Available from: http://hdl.handle.net/10321/2620.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Sipahli S. Identification, characterization and application of a natural food colourant from Hibiscus sabdariffa. [Thesis]. Durban University of Technology; 2017. Available from: http://hdl.handle.net/10321/2620

Not specified: Masters Thesis or Doctoral Dissertation

Rochester Institute of Technology

9. McClive, Jacqueline. Rank numbers for graphs with paths and cycles.

Degree: School of Mathematical Sciences (COS), 2010, Rochester Institute of Technology

URL: https://scholarworks.rit.edu/theses/4986

► A *coloring* of a graph, G, is an assignment of positive integers to the vertices of the graph with one number assigned to each vertex,…
(more)

Subjects/Keywords: Coloring; Cycle; Graph; Path; Ranking

Record Details Similar Records

❌

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

APA (6^{th} Edition):

McClive, J. (2010). Rank numbers for graphs with paths and cycles. (Thesis). Rochester Institute of Technology. Retrieved from https://scholarworks.rit.edu/theses/4986

Not specified: Masters Thesis or Doctoral Dissertation

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

McClive, Jacqueline. “Rank numbers for graphs with paths and cycles.” 2010. Thesis, Rochester Institute of Technology. Accessed September 29, 2020. https://scholarworks.rit.edu/theses/4986.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

McClive, Jacqueline. “Rank numbers for graphs with paths and cycles.” 2010. Web. 29 Sep 2020.

Vancouver:

McClive J. Rank numbers for graphs with paths and cycles. [Internet] [Thesis]. Rochester Institute of Technology; 2010. [cited 2020 Sep 29]. Available from: https://scholarworks.rit.edu/theses/4986.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

McClive J. Rank numbers for graphs with paths and cycles. [Thesis]. Rochester Institute of Technology; 2010. Available from: https://scholarworks.rit.edu/theses/4986

Not specified: Masters Thesis or Doctoral Dissertation

Princeton University

10.
Spirkl, Sophie Theresa.
Cliques, stable sets, and *coloring* in graphs with forbidden induced subgraphs
.

Degree: PhD, 2018, Princeton University

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

► The Gyarfás-Sumner conjecture [29, 42] states that for every tree T there is a function f such that for every graph G with no induced…
(more)

Subjects/Keywords: coloring; graph theory; induced subgraph

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Spirkl, S. T. (2018). Cliques, stable sets, and coloring in graphs with forbidden induced subgraphs . (Doctoral Dissertation). Princeton University. Retrieved from http://arks.princeton.edu/ark:/88435/dsp01zw12z7994

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

Spirkl, Sophie Theresa. “Cliques, stable sets, and coloring in graphs with forbidden induced subgraphs .” 2018. Doctoral Dissertation, Princeton University. Accessed September 29, 2020. http://arks.princeton.edu/ark:/88435/dsp01zw12z7994.

MLA Handbook (7^{th} Edition):

Spirkl, Sophie Theresa. “Cliques, stable sets, and coloring in graphs with forbidden induced subgraphs .” 2018. Web. 29 Sep 2020.

Vancouver:

Spirkl ST. Cliques, stable sets, and coloring in graphs with forbidden induced subgraphs . [Internet] [Doctoral dissertation]. Princeton University; 2018. [cited 2020 Sep 29]. Available from: http://arks.princeton.edu/ark:/88435/dsp01zw12z7994.

Council of Science Editors:

Spirkl ST. Cliques, stable sets, and coloring in graphs with forbidden induced subgraphs . [Doctoral Dissertation]. Princeton University; 2018. Available from: http://arks.princeton.edu/ark:/88435/dsp01zw12z7994

Georgia Tech

11.
Xie, Qiqin.
* Coloring* graphs with no k5-subdivision: disjoint paths in graphs.

Degree: PhD, Mathematics, 2019, Georgia Tech

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

► The Four Color Theorem states that every planar graph is 4-colorable. Hajos conjectured that for any positive integer k, every graph containing no K_{k+1}-subdivision is…
(more)

Subjects/Keywords: Graph coloring; Hajos conjecture

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Xie, Q. (2019). Coloring graphs with no k5-subdivision: disjoint paths in graphs. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/62659

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

Xie, Qiqin. “Coloring graphs with no k5-subdivision: disjoint paths in graphs.” 2019. Doctoral Dissertation, Georgia Tech. Accessed September 29, 2020. http://hdl.handle.net/1853/62659.

MLA Handbook (7^{th} Edition):

Xie, Qiqin. “Coloring graphs with no k5-subdivision: disjoint paths in graphs.” 2019. Web. 29 Sep 2020.

Vancouver:

Xie Q. Coloring graphs with no k5-subdivision: disjoint paths in graphs. [Internet] [Doctoral dissertation]. Georgia Tech; 2019. [cited 2020 Sep 29]. Available from: http://hdl.handle.net/1853/62659.

Council of Science Editors:

Xie Q. Coloring graphs with no k5-subdivision: disjoint paths in graphs. [Doctoral Dissertation]. Georgia Tech; 2019. Available from: http://hdl.handle.net/1853/62659

Louisiana State University

12.
Guillot, Daniel Allen.
* Coloring* Graphs Drawn with Crossings.

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

URL: etd-07092014-113110 ; https://digitalcommons.lsu.edu/gradschool_dissertations/3411

► This dissertation will examine various results for graph colorings. It begins by introducing some basic graph theory concepts, focusing on those ideas relevant to graph…
(more)

Subjects/Keywords: coloring; surface; crossing; graph

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Guillot, D. A. (2014). Coloring Graphs Drawn with Crossings. (Doctoral Dissertation). Louisiana State University. Retrieved from etd-07092014-113110 ; https://digitalcommons.lsu.edu/gradschool_dissertations/3411

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

Guillot, Daniel Allen. “Coloring Graphs Drawn with Crossings.” 2014. Doctoral Dissertation, Louisiana State University. Accessed September 29, 2020. etd-07092014-113110 ; https://digitalcommons.lsu.edu/gradschool_dissertations/3411.

MLA Handbook (7^{th} Edition):

Guillot, Daniel Allen. “Coloring Graphs Drawn with Crossings.” 2014. Web. 29 Sep 2020.

Vancouver:

Guillot DA. Coloring Graphs Drawn with Crossings. [Internet] [Doctoral dissertation]. Louisiana State University; 2014. [cited 2020 Sep 29]. Available from: etd-07092014-113110 ; https://digitalcommons.lsu.edu/gradschool_dissertations/3411.

Council of Science Editors:

Guillot DA. Coloring Graphs Drawn with Crossings. [Doctoral Dissertation]. Louisiana State University; 2014. Available from: etd-07092014-113110 ; https://digitalcommons.lsu.edu/gradschool_dissertations/3411

University of Montana

13. Rafferty, Liam. D-colorable digraphs with large girth.

Degree: PhD, 2011, University of Montana

URL: https://scholarworks.umt.edu/etd/290

► In 1959 Paul Erdos (Graph theory and probability, Canad. J. Math. 11 (1959), 34-38) famously proved, nonconstructively, that there exist graphs that have both…
(more)

Subjects/Keywords: acyclic; coloring; digraph; graph; homomorphism

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Rafferty, L. (2011). D-colorable digraphs with large girth. (Doctoral Dissertation). University of Montana. Retrieved from https://scholarworks.umt.edu/etd/290

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

Rafferty, Liam. “D-colorable digraphs with large girth.” 2011. Doctoral Dissertation, University of Montana. Accessed September 29, 2020. https://scholarworks.umt.edu/etd/290.

MLA Handbook (7^{th} Edition):

Rafferty, Liam. “D-colorable digraphs with large girth.” 2011. Web. 29 Sep 2020.

Vancouver:

Rafferty L. D-colorable digraphs with large girth. [Internet] [Doctoral dissertation]. University of Montana; 2011. [cited 2020 Sep 29]. Available from: https://scholarworks.umt.edu/etd/290.

Council of Science Editors:

Rafferty L. D-colorable digraphs with large girth. [Doctoral Dissertation]. University of Montana; 2011. Available from: https://scholarworks.umt.edu/etd/290

Iowa State University

14.
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 September 29, 2020. 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. 29 Sep 2020.

Vancouver:

Lastrina MA. List-coloring and sum-list-coloring problems on graphs. [Internet] [Thesis]. Iowa State University; 2012. [cited 2020 Sep 29]. 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

Kent State University

15. Viyyure, Uday Kiran Varma. Frequency Assignments in Radio Networks.

Degree: MS, College of Arts and Sciences / Department of Computer Science, 2008, Kent State University

URL: http://rave.ohiolink.edu/etdc/view?acc_num=kent1209060158

► In our paper we discuss the frequency assignment problem for cellular networks. Many methods and ways have been proposed for solving this problem like neural…
(more)

Subjects/Keywords: Computer Science; Frequency Assignment; graph coloring

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Viyyure, U. K. V. (2008). Frequency Assignments in Radio Networks. (Masters Thesis). Kent State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=kent1209060158

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

Viyyure, Uday Kiran Varma. “Frequency Assignments in Radio Networks.” 2008. Masters Thesis, Kent State University. Accessed September 29, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=kent1209060158.

MLA Handbook (7^{th} Edition):

Viyyure, Uday Kiran Varma. “Frequency Assignments in Radio Networks.” 2008. Web. 29 Sep 2020.

Vancouver:

Viyyure UKV. Frequency Assignments in Radio Networks. [Internet] [Masters thesis]. Kent State University; 2008. [cited 2020 Sep 29]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=kent1209060158.

Council of Science Editors:

Viyyure UKV. Frequency Assignments in Radio Networks. [Masters Thesis]. Kent State University; 2008. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=kent1209060158

Anna University

16.
Anitha A.
Studies in graphtheory degree equitable *coloring* and
equitable domination in graphs;.

Degree: Studies in graphtheory degree equitable coloring and equitable domination in graphs, 2015, Anna University

URL: http://shodhganga.inflibnet.ac.in/handle/10603/33697

►

By a graph G VE we mean a finite undirected graph newlinewith neither loops nor multiple edges The order and size of G are newlinedenoted… (more)

Subjects/Keywords: coloring and equitable; graphtheory; science and humanities

Record Details Similar Records

❌

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

APA (6^{th} Edition):

A, A. (2015). Studies in graphtheory degree equitable coloring and equitable domination in graphs;. (Thesis). Anna University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/33697

Not specified: Masters Thesis or Doctoral Dissertation

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

A, Anitha. “Studies in graphtheory degree equitable coloring and equitable domination in graphs;.” 2015. Thesis, Anna University. Accessed September 29, 2020. http://shodhganga.inflibnet.ac.in/handle/10603/33697.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

A, Anitha. “Studies in graphtheory degree equitable coloring and equitable domination in graphs;.” 2015. Web. 29 Sep 2020.

Vancouver:

A A. Studies in graphtheory degree equitable coloring and equitable domination in graphs;. [Internet] [Thesis]. Anna University; 2015. [cited 2020 Sep 29]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/33697.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

A A. Studies in graphtheory degree equitable coloring and equitable domination in graphs;. [Thesis]. Anna University; 2015. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/33697

Not specified: Masters Thesis or Doctoral Dissertation

17.
Kaliraj, K.
On equitable *coloring* of grapes; -.

Degree: mathematics, 2013, Anna University

URL: http://shodhganga.inflibnet.ac.in/handle/10603/22199

►

This thesis entitled ON EQUITABLE *COLORING* OF GRAPHS newlineconsists of seven chapters In Chapter 1 the origin and development of graph theory is given briefly…
(more)

Subjects/Keywords: chromatic graph; coloring; corona; equitable; grapes

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Kaliraj, K. (2013). On equitable coloring of grapes; -. (Thesis). Anna University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/22199

Not specified: Masters Thesis or Doctoral Dissertation

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

Kaliraj, K. “On equitable coloring of grapes; -.” 2013. Thesis, Anna University. Accessed September 29, 2020. http://shodhganga.inflibnet.ac.in/handle/10603/22199.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Kaliraj, K. “On equitable coloring of grapes; -.” 2013. Web. 29 Sep 2020.

Vancouver:

Kaliraj K. On equitable coloring of grapes; -. [Internet] [Thesis]. Anna University; 2013. [cited 2020 Sep 29]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/22199.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Kaliraj K. On equitable coloring of grapes; -. [Thesis]. Anna University; 2013. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/22199

Not specified: Masters Thesis or Doctoral Dissertation

18.
Kaliraj, K.
On equitable *coloring* of grapes; -.

Degree: mathematics, 2013, Anna University

URL: http://shodhganga.inflibnet.ac.in/handle/10603/22201

►

This thesis entitled ON EQUITABLE *COLORING* OF GRAPHS newlineconsists of seven chapters In Chapter 1 the origin and development of graph theory is given briefly…
(more)

Subjects/Keywords: chromatic graph; coloring; corona; equitable; grapes

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Kaliraj, K. (2013). On equitable coloring of grapes; -. (Thesis). Anna University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/22201

Not specified: Masters Thesis or Doctoral Dissertation

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

Kaliraj, K. “On equitable coloring of grapes; -.” 2013. Thesis, Anna University. Accessed September 29, 2020. http://shodhganga.inflibnet.ac.in/handle/10603/22201.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Kaliraj, K. “On equitable coloring of grapes; -.” 2013. Web. 29 Sep 2020.

Vancouver:

Kaliraj K. On equitable coloring of grapes; -. [Internet] [Thesis]. Anna University; 2013. [cited 2020 Sep 29]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/22201.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Kaliraj K. On equitable coloring of grapes; -. [Thesis]. Anna University; 2013. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/22201

Not specified: Masters Thesis or Doctoral Dissertation

University of Waterloo

19.
Chiniforooshan, Ehsan Jay.
Intersperse * Coloring*.

Degree: 2007, University of Waterloo

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

► In this thesis, we introduce the intersperse *coloring* problem, which is a generalized version of the hypergraph *coloring* problem. In the intersperse *coloring* problem, we…
(more)

Subjects/Keywords: Graph Coloring; Hypergraph

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Chiniforooshan, E. J. (2007). Intersperse Coloring. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/3331

Not specified: Masters Thesis or Doctoral Dissertation

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

Chiniforooshan, Ehsan Jay. “Intersperse Coloring.” 2007. Thesis, University of Waterloo. Accessed September 29, 2020. http://hdl.handle.net/10012/3331.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Chiniforooshan, Ehsan Jay. “Intersperse Coloring.” 2007. Web. 29 Sep 2020.

Vancouver:

Chiniforooshan EJ. Intersperse Coloring. [Internet] [Thesis]. University of Waterloo; 2007. [cited 2020 Sep 29]. Available from: http://hdl.handle.net/10012/3331.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Chiniforooshan EJ. Intersperse Coloring. [Thesis]. University of Waterloo; 2007. Available from: http://hdl.handle.net/10012/3331

Not specified: Masters Thesis or Doctoral Dissertation

University of Johannesburg

20. Raubenheimer, Fredrika Susanna. Acyclic colourings of planar graphs.

Degree: 2012, University of Johannesburg

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

►

M.Sc.

Within the field of Graph Theory the many ways in which graphs can be coloured have received a lot of attention over the years.… (more)

Subjects/Keywords: Graph coloring; Four-color problem; Cayley graphs

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Raubenheimer, F. S. (2012). Acyclic colourings of planar graphs. (Thesis). University of Johannesburg. Retrieved from http://hdl.handle.net/10210/6259

Not specified: Masters Thesis or Doctoral Dissertation

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

Raubenheimer, Fredrika Susanna. “Acyclic colourings of planar graphs.” 2012. Thesis, University of Johannesburg. Accessed September 29, 2020. http://hdl.handle.net/10210/6259.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Raubenheimer, Fredrika Susanna. “Acyclic colourings of planar graphs.” 2012. Web. 29 Sep 2020.

Vancouver:

Raubenheimer FS. Acyclic colourings of planar graphs. [Internet] [Thesis]. University of Johannesburg; 2012. [cited 2020 Sep 29]. Available from: http://hdl.handle.net/10210/6259.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Raubenheimer FS. Acyclic colourings of planar graphs. [Thesis]. University of Johannesburg; 2012. Available from: http://hdl.handle.net/10210/6259

Not specified: Masters Thesis or Doctoral Dissertation

Victoria University of Wellington

21. Kelly, Fern M. Multifunctional Textiles from New Zealand Wool Coloured with Silver or Silver Halide Nanoparticles.

Degree: 2009, Victoria University of Wellington

URL: http://hdl.handle.net/10063/4217

► Significant opportunities exist for the development of innovative multifunctional textiles for high value market applications. Composites that combine the inherent properties of their all precursor…
(more)

Subjects/Keywords: Merino; Textile coloring

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Kelly, F. M. (2009). Multifunctional Textiles from New Zealand Wool Coloured with Silver or Silver Halide Nanoparticles. (Doctoral Dissertation). Victoria University of Wellington. Retrieved from http://hdl.handle.net/10063/4217

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

Kelly, Fern M. “Multifunctional Textiles from New Zealand Wool Coloured with Silver or Silver Halide Nanoparticles.” 2009. Doctoral Dissertation, Victoria University of Wellington. Accessed September 29, 2020. http://hdl.handle.net/10063/4217.

MLA Handbook (7^{th} Edition):

Kelly, Fern M. “Multifunctional Textiles from New Zealand Wool Coloured with Silver or Silver Halide Nanoparticles.” 2009. Web. 29 Sep 2020.

Vancouver:

Kelly FM. Multifunctional Textiles from New Zealand Wool Coloured with Silver or Silver Halide Nanoparticles. [Internet] [Doctoral dissertation]. Victoria University of Wellington; 2009. [cited 2020 Sep 29]. Available from: http://hdl.handle.net/10063/4217.

Council of Science Editors:

Kelly FM. Multifunctional Textiles from New Zealand Wool Coloured with Silver or Silver Halide Nanoparticles. [Doctoral Dissertation]. Victoria University of Wellington; 2009. Available from: http://hdl.handle.net/10063/4217

Texas State University – San Marcos

22.
Liu, Yiqian.
Out-of-Core Graph *Coloring* Algorithm.

Degree: MS, Computer Science, 2020, Texas State University – San Marcos

URL: https://digital.library.txstate.edu/handle/10877/12256

► Out-of-core algorithms can process data sets that are too large to fit entirely into the computer’s main memory. This thesis develops an out-of-core algorithm for…
(more)

Subjects/Keywords: Out-of-core algorithm; Graph coloring

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Liu, Y. (2020). Out-of-Core Graph Coloring Algorithm. (Masters Thesis). Texas State University – San Marcos. Retrieved from https://digital.library.txstate.edu/handle/10877/12256

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

Liu, Yiqian. “Out-of-Core Graph Coloring Algorithm.” 2020. Masters Thesis, Texas State University – San Marcos. Accessed September 29, 2020. https://digital.library.txstate.edu/handle/10877/12256.

MLA Handbook (7^{th} Edition):

Liu, Yiqian. “Out-of-Core Graph Coloring Algorithm.” 2020. Web. 29 Sep 2020.

Vancouver:

Liu Y. Out-of-Core Graph Coloring Algorithm. [Internet] [Masters thesis]. Texas State University – San Marcos; 2020. [cited 2020 Sep 29]. Available from: https://digital.library.txstate.edu/handle/10877/12256.

Council of Science Editors:

Liu Y. Out-of-Core Graph Coloring Algorithm. [Masters Thesis]. Texas State University – San Marcos; 2020. Available from: https://digital.library.txstate.edu/handle/10877/12256

Boston University

23.
Alhenaki, Aasem Mutlaq.
Effect of different fabrication processes and *coloring* on the properties of monolithic alumina.

Degree: Doctor of Science in Dentistry, Prosthodontics, 2019, Boston University

URL: http://hdl.handle.net/2144/35682

► OBJECTIVES: To investigate the effect of different alumina fabrication techniques and sintering temperatures on the biaxial flexural strength. Also, to assess the resulting color of…
(more)

Subjects/Keywords: Dentistry; Alumina; Coloring; Fabrication processes; Properties

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Alhenaki, A. M. (2019). Effect of different fabrication processes and coloring on the properties of monolithic alumina. (Doctoral Dissertation). Boston University. Retrieved from http://hdl.handle.net/2144/35682

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

Alhenaki, Aasem Mutlaq. “Effect of different fabrication processes and coloring on the properties of monolithic alumina.” 2019. Doctoral Dissertation, Boston University. Accessed September 29, 2020. http://hdl.handle.net/2144/35682.

MLA Handbook (7^{th} Edition):

Alhenaki, Aasem Mutlaq. “Effect of different fabrication processes and coloring on the properties of monolithic alumina.” 2019. Web. 29 Sep 2020.

Vancouver:

Alhenaki AM. Effect of different fabrication processes and coloring on the properties of monolithic alumina. [Internet] [Doctoral dissertation]. Boston University; 2019. [cited 2020 Sep 29]. Available from: http://hdl.handle.net/2144/35682.

Council of Science Editors:

Alhenaki AM. Effect of different fabrication processes and coloring on the properties of monolithic alumina. [Doctoral Dissertation]. Boston University; 2019. Available from: http://hdl.handle.net/2144/35682

Wesleyan University

24. Cooper, Catherine Ann. Precoloring Extensions Involving Cliques and the Pairwise Distance Needed Between Them.

Degree: Mathematics, 2019, Wesleyan University

URL: https://wesscholar.wesleyan.edu/etd_mas_theses/251

► The main focus of this paper is exploring precoloring extensions problems, specifically when the precolored subgraph consists of cliques. We explore this topic by…
(more)

Subjects/Keywords: Graph Theory; vertex coloring; precoloring extension; clique

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Cooper, C. A. (2019). Precoloring Extensions Involving Cliques and the Pairwise Distance Needed Between Them. (Masters Thesis). Wesleyan University. Retrieved from https://wesscholar.wesleyan.edu/etd_mas_theses/251

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

Cooper, Catherine Ann. “Precoloring Extensions Involving Cliques and the Pairwise Distance Needed Between Them.” 2019. Masters Thesis, Wesleyan University. Accessed September 29, 2020. https://wesscholar.wesleyan.edu/etd_mas_theses/251.

MLA Handbook (7^{th} Edition):

Cooper, Catherine Ann. “Precoloring Extensions Involving Cliques and the Pairwise Distance Needed Between Them.” 2019. Web. 29 Sep 2020.

Vancouver:

Cooper CA. Precoloring Extensions Involving Cliques and the Pairwise Distance Needed Between Them. [Internet] [Masters thesis]. Wesleyan University; 2019. [cited 2020 Sep 29]. Available from: https://wesscholar.wesleyan.edu/etd_mas_theses/251.

Council of Science Editors:

Cooper CA. Precoloring Extensions Involving Cliques and the Pairwise Distance Needed Between Them. [Masters Thesis]. Wesleyan University; 2019. Available from: https://wesscholar.wesleyan.edu/etd_mas_theses/251

University of Victoria

25. Duffy, Christopher. Homomorphisms of (j, k)-mixed graphs.

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

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

► A mixed graph is a simple graph in which a subset of the edges have been assigned directions to form arcs. For non-negative integers j…
(more)

Subjects/Keywords: graph theory; coloring; homomorphism; algorithms; complexity

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Duffy, C. (2015). Homomorphisms of (j, k)-mixed graphs. (Thesis). University of Victoria. Retrieved from http://hdl.handle.net/1828/6601

Not specified: Masters Thesis or Doctoral Dissertation

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

Duffy, Christopher. “Homomorphisms of (j, k)-mixed graphs.” 2015. Thesis, University of Victoria. Accessed September 29, 2020. http://hdl.handle.net/1828/6601.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Duffy, Christopher. “Homomorphisms of (j, k)-mixed graphs.” 2015. Web. 29 Sep 2020.

Vancouver:

Duffy C. Homomorphisms of (j, k)-mixed graphs. [Internet] [Thesis]. University of Victoria; 2015. [cited 2020 Sep 29]. Available from: http://hdl.handle.net/1828/6601.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Duffy C. Homomorphisms of (j, k)-mixed graphs. [Thesis]. University of Victoria; 2015. Available from: http://hdl.handle.net/1828/6601

Not specified: Masters Thesis or Doctoral Dissertation

University of Arizona

26. Ahmed, Omer Khidir. REGULATION OF DEGREENING AND REGREENING OF CITRUS PEEL WITH SELECTED CARBOHYDRATE AND NITROGEN COMPOUNDS IN VITRO.

Degree: 1986, University of Arizona

URL: http://hdl.handle.net/10150/188139

► The regulation of citrus fruit color by various concentrations of sugars, sugar metabolites, and nitrogen compounds was investigated in peel segments of Citrus paradisi Macf.…
(more)

Subjects/Keywords: Citrus fruits – Coloring.

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Ahmed, O. K. (1986). REGULATION OF DEGREENING AND REGREENING OF CITRUS PEEL WITH SELECTED CARBOHYDRATE AND NITROGEN COMPOUNDS IN VITRO. (Doctoral Dissertation). University of Arizona. Retrieved from http://hdl.handle.net/10150/188139

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

Ahmed, Omer Khidir. “REGULATION OF DEGREENING AND REGREENING OF CITRUS PEEL WITH SELECTED CARBOHYDRATE AND NITROGEN COMPOUNDS IN VITRO. ” 1986. Doctoral Dissertation, University of Arizona. Accessed September 29, 2020. http://hdl.handle.net/10150/188139.

MLA Handbook (7^{th} Edition):

Ahmed, Omer Khidir. “REGULATION OF DEGREENING AND REGREENING OF CITRUS PEEL WITH SELECTED CARBOHYDRATE AND NITROGEN COMPOUNDS IN VITRO. ” 1986. Web. 29 Sep 2020.

Vancouver:

Ahmed OK. REGULATION OF DEGREENING AND REGREENING OF CITRUS PEEL WITH SELECTED CARBOHYDRATE AND NITROGEN COMPOUNDS IN VITRO. [Internet] [Doctoral dissertation]. University of Arizona; 1986. [cited 2020 Sep 29]. Available from: http://hdl.handle.net/10150/188139.

Council of Science Editors:

Ahmed OK. REGULATION OF DEGREENING AND REGREENING OF CITRUS PEEL WITH SELECTED CARBOHYDRATE AND NITROGEN COMPOUNDS IN VITRO. [Doctoral Dissertation]. University of Arizona; 1986. Available from: http://hdl.handle.net/10150/188139

Rochester Institute of Technology

27.
Radin, Andrew.
Graph *coloring* heuristics from investigation of smallest hard to color graphs.

Degree: Computer Science (GCCIS), 2000, Rochester Institute of Technology

URL: https://scholarworks.rit.edu/theses/660

► Vertex *coloring* of graphs is an NP-complete problem. No polynomial time algorithm is known to color graphs optimally. The best we can do to handle…
(more)

Subjects/Keywords: Coloring heuristics; Computer science; Optimal coloring

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Radin, A. (2000). Graph coloring heuristics from investigation of smallest hard to color graphs. (Thesis). Rochester Institute of Technology. Retrieved from https://scholarworks.rit.edu/theses/660

Not specified: Masters Thesis or Doctoral Dissertation

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

Radin, Andrew. “Graph coloring heuristics from investigation of smallest hard to color graphs.” 2000. Thesis, Rochester Institute of Technology. Accessed September 29, 2020. https://scholarworks.rit.edu/theses/660.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Radin, Andrew. “Graph coloring heuristics from investigation of smallest hard to color graphs.” 2000. Web. 29 Sep 2020.

Vancouver:

Radin A. Graph coloring heuristics from investigation of smallest hard to color graphs. [Internet] [Thesis]. Rochester Institute of Technology; 2000. [cited 2020 Sep 29]. Available from: https://scholarworks.rit.edu/theses/660.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Radin A. Graph coloring heuristics from investigation of smallest hard to color graphs. [Thesis]. Rochester Institute of Technology; 2000. Available from: https://scholarworks.rit.edu/theses/660

Not specified: Masters Thesis or Doctoral Dissertation

Western Michigan University

28. Johnston, Daniel. Edge Colorings of Graphs and Their Applications.

Degree: PhD, Mathematics, 2015, Western Michigan University

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

► Edge colorings have appeared in a variety of contexts in graph theory. In this work, we study problems occurring in three separate settings of…
(more)

Subjects/Keywords: Edge coloring; Twin edge coloring; K-Ramsey; Domination; Matching; Graphs; Mathematics applications; Applied Mathematics; Mathematics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Johnston, D. (2015). Edge Colorings of Graphs and Their Applications. (Doctoral Dissertation). Western Michigan University. Retrieved from https://scholarworks.wmich.edu/dissertations/586

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

Johnston, Daniel. “Edge Colorings of Graphs and Their Applications.” 2015. Doctoral Dissertation, Western Michigan University. Accessed September 29, 2020. https://scholarworks.wmich.edu/dissertations/586.

MLA Handbook (7^{th} Edition):

Johnston, Daniel. “Edge Colorings of Graphs and Their Applications.” 2015. Web. 29 Sep 2020.

Vancouver:

Johnston D. Edge Colorings of Graphs and Their Applications. [Internet] [Doctoral dissertation]. Western Michigan University; 2015. [cited 2020 Sep 29]. Available from: https://scholarworks.wmich.edu/dissertations/586.

Council of Science Editors:

Johnston D. Edge Colorings of Graphs and Their Applications. [Doctoral Dissertation]. Western Michigan University; 2015. Available from: https://scholarworks.wmich.edu/dissertations/586

Western Michigan University

29. Bi, Zhenming. Highly Hamiltonian Graphs and Digraphs.

Degree: PhD, Mathematics, 2017, Western Michigan University

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

► A cycle that contains every vertex of a graph or digraph is a Hamiltonian cycle. A graph or digraph containing such a cycle is…
(more)

Subjects/Keywords: Rainbow coloring; Hamiltonian graph; Hamiltonian cycles; Hamiltonian extension; Hamiltonian digraph; proper coloring; Applied Mathematics; Mathematics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Bi, Z. (2017). Highly Hamiltonian Graphs and Digraphs. (Doctoral Dissertation). Western Michigan University. Retrieved from https://scholarworks.wmich.edu/dissertations/3143

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

Bi, Zhenming. “Highly Hamiltonian Graphs and Digraphs.” 2017. Doctoral Dissertation, Western Michigan University. Accessed September 29, 2020. https://scholarworks.wmich.edu/dissertations/3143.

MLA Handbook (7^{th} Edition):

Bi, Zhenming. “Highly Hamiltonian Graphs and Digraphs.” 2017. Web. 29 Sep 2020.

Vancouver:

Bi Z. Highly Hamiltonian Graphs and Digraphs. [Internet] [Doctoral dissertation]. Western Michigan University; 2017. [cited 2020 Sep 29]. Available from: https://scholarworks.wmich.edu/dissertations/3143.

Council of Science Editors:

Bi Z. Highly Hamiltonian Graphs and Digraphs. [Doctoral Dissertation]. Western Michigan University; 2017. Available from: https://scholarworks.wmich.edu/dissertations/3143

Uppsala University

30.
Normann, Per.
Parallel graph *coloring* : Parallel graph *coloring* on multi-core CPUs.

Degree: Division of Scientific Computing, 2014, Uppsala University

URL: http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-227656

► In recent times an evident trend in hardware is to opt for multi-core CPUs. This has lead to a situation where an increasing number…
(more)

Subjects/Keywords: Parallel graph coloring multi coloring; Computer and Information Sciences; Data- och informationsvetenskap

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Normann, P. (2014). Parallel graph coloring : Parallel graph coloring on multi-core CPUs. (Thesis). Uppsala University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-227656

Not specified: Masters Thesis or Doctoral Dissertation

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

Normann, Per. “Parallel graph coloring : Parallel graph coloring on multi-core CPUs.” 2014. Thesis, Uppsala University. Accessed September 29, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-227656.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Normann, Per. “Parallel graph coloring : Parallel graph coloring on multi-core CPUs.” 2014. Web. 29 Sep 2020.

Vancouver:

Normann P. Parallel graph coloring : Parallel graph coloring on multi-core CPUs. [Internet] [Thesis]. Uppsala University; 2014. [cited 2020 Sep 29]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-227656.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Normann P. Parallel graph coloring : Parallel graph coloring on multi-core CPUs. [Thesis]. Uppsala University; 2014. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-227656

Not specified: Masters Thesis or Doctoral Dissertation