Advanced search options

Advanced Search Options 🞨

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

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

Sorted by: relevance · author · university · dateNew search

You searched for subject:(graph coloring). Showing records 1 – 30 of 179 total matches.

[1] [2] [3] [4] [5] [6]

Search Limiters

Last 2 Years | English Only

Department

Degrees

Levels

Languages

Country

▼ 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

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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Immelman, Y. (2009). On the (upper) line-distinguishing and (upper) harmonious chromatic numbers of a graph. (Thesis). University of Johannesburg. Retrieved from http://hdl.handle.net/10210/2359

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

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

Immelman, Yolande. “On the (upper) line-distinguishing and (upper) harmonious chromatic numbers of a graph.” 2009. Web. 21 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 21]. Available from: http://hdl.handle.net/10210/2359.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Immelman Y. On the (upper) line-distinguishing and (upper) harmonious chromatic numbers of a graph. [Thesis]. University of Johannesburg; 2009. Available from: http://hdl.handle.net/10210/2359

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


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

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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

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

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

MLA Handbook (7th Edition):

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

Vancouver:

Adams SE. Chromatic Polynomials for Graphs with Split Vertices. [Internet] [Masters thesis]. Bowling Green State University; 2020. [cited 2020 Sep 21]. 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 Hong Kong

3. 李靜文. Various coloring problems on plane graphs.

Degree: 2007, University of Hong Kong

Subjects/Keywords: Graph coloring.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

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

李靜文. “Various coloring problems on plane graphs.” 2007. Thesis, University of Hong Kong. Accessed September 21, 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 (7th Edition):

李靜文. “Various coloring problems on plane graphs.” 2007. Web. 21 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 21]. 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

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Not specified: Masters Thesis or Doctoral Dissertation


Rochester Institute of Technology

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

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

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

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

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

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

Vancouver:

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

Note: this citation may be lacking information needed for this citation format:
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

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Princeton University

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

Degree: PhD, 2018, Princeton University

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

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

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

MLA Handbook (7th Edition):

Spirkl, Sophie Theresa. “Cliques, stable sets, and coloring in graphs with forbidden induced subgraphs .” 2018. Web. 21 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 21]. 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

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

Degree: PhD, Mathematics, 2019, Georgia Tech

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

Subjects/Keywords: Graph coloring; Hajos conjecture

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

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

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

MLA Handbook (7th Edition):

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

Vancouver:

Xie Q. Coloring graphs with no k5-subdivision: disjoint paths in graphs. [Internet] [Doctoral dissertation]. Georgia Tech; 2019. [cited 2020 Sep 21]. 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

7. Guillot, Daniel Allen. Coloring Graphs Drawn with Crossings.

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

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

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

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

MLA Handbook (7th Edition):

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

Vancouver:

Guillot DA. Coloring Graphs Drawn with Crossings. [Internet] [Doctoral dissertation]. Louisiana State University; 2014. [cited 2020 Sep 21]. 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

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

Degree: PhD, 2011, University of Montana

  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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

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

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

MLA Handbook (7th Edition):

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

Vancouver:

Rafferty L. D-colorable digraphs with large girth. [Internet] [Doctoral dissertation]. University of Montana; 2011. [cited 2020 Sep 21]. 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


University of Waterloo

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

Degree: 2019, University of Waterloo

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

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

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

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

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

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

Vancouver:

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

Note: this citation may be lacking information needed for this citation format:
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

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Illinois – Urbana-Champaign

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

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

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

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

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

MLA Handbook (7th Edition):

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

Vancouver:

Reiniger BM. Coloring and constructing (hyper)graphs with restrictions. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2015. [cited 2020 Sep 21]. 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


Iowa State University

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

Degree: 2012, Iowa State University

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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

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

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Lastrina, Michelle Anne. “List-coloring and sum-list-coloring problems on graphs.” 2012. Web. 21 Sep 2020.

Vancouver:

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

Note: this citation may be lacking information needed for this citation format:
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

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Kent State University

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

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

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

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

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

MLA Handbook (7th Edition):

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

Vancouver:

Viyyure UKV. Frequency Assignments in Radio Networks. [Internet] [Masters thesis]. Kent State University; 2008. [cited 2020 Sep 21]. 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

13. Kaliraj, K. On equitable coloring of grapes; -.

Degree: mathematics, 2013, Anna University

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

Page 1

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

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

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

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

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

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

Vancouver:

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

Note: this citation may be lacking information needed for this citation format:
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

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

14. Kaliraj, K. On equitable coloring of grapes; -.

Degree: mathematics, 2013, Anna University

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

Page 1

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

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

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

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

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

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

Vancouver:

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

Note: this citation may be lacking information needed for this citation format:
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

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Waterloo

15. Chiniforooshan, Ehsan Jay. Intersperse Coloring.

Degree: 2007, University of Waterloo

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

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

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

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

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

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

Vancouver:

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

Note: this citation may be lacking information needed for this citation format:
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

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Johannesburg

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

Degree: 2012, University of Johannesburg

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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

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

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

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

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

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

Vancouver:

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

Note: this citation may be lacking information needed for this citation format:
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

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Texas State University – San Marcos

17. Liu, Yiqian. Out-of-Core Graph Coloring Algorithm.

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

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

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

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

MLA Handbook (7th Edition):

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

Vancouver:

Liu Y. Out-of-Core Graph Coloring Algorithm. [Internet] [Masters thesis]. Texas State University – San Marcos; 2020. [cited 2020 Sep 21]. 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


Wesleyan University

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

Degree: Mathematics, 2019, Wesleyan University

  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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

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

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

MLA Handbook (7th Edition):

Cooper, Catherine Ann. “Precoloring Extensions Involving Cliques and the Pairwise Distance Needed Between Them.” 2019. Web. 21 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 21]. 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

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

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

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

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

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

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

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

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

Vancouver:

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

Note: this citation may be lacking information needed for this citation format:
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

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Georgia Tech

20. Zickfeld, Florian. On the Structure of Counterexamples to the Coloring Conjecture of Hajós.

Degree: MS, Mathematics, 2004, Georgia Tech

 Hajós conjectured that, for any positive integer k, every graph containing no K_(k+1)-subdivision is k-colorable. This is true when k is at most three, and… (more)

Subjects/Keywords: Graph coloring; Hajós' conjecture; Graph coloring

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zickfeld, F. (2004). On the Structure of Counterexamples to the Coloring Conjecture of Hajós. (Masters Thesis). Georgia Tech. Retrieved from http://hdl.handle.net/1853/4994

Chicago Manual of Style (16th Edition):

Zickfeld, Florian. “On the Structure of Counterexamples to the Coloring Conjecture of Hajós.” 2004. Masters Thesis, Georgia Tech. Accessed September 21, 2020. http://hdl.handle.net/1853/4994.

MLA Handbook (7th Edition):

Zickfeld, Florian. “On the Structure of Counterexamples to the Coloring Conjecture of Hajós.” 2004. Web. 21 Sep 2020.

Vancouver:

Zickfeld F. On the Structure of Counterexamples to the Coloring Conjecture of Hajós. [Internet] [Masters thesis]. Georgia Tech; 2004. [cited 2020 Sep 21]. Available from: http://hdl.handle.net/1853/4994.

Council of Science Editors:

Zickfeld F. On the Structure of Counterexamples to the Coloring Conjecture of Hajós. [Masters Thesis]. Georgia Tech; 2004. Available from: http://hdl.handle.net/1853/4994


University of Johannesburg

21. Ras, Charl John. λd,1-Minimal trees and full colorability of some classes of graphs.

Degree: 2009, University of Johannesburg

Subjects/Keywords: Trees (Graph theory); Graph coloring

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ras, C. J. (2009). λd,1-Minimal trees and full colorability of some classes of graphs. (Thesis). University of Johannesburg. Retrieved from http://hdl.handle.net/10210/2465

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Ras, Charl John. “λd,1-Minimal trees and full colorability of some classes of graphs.” 2009. Thesis, University of Johannesburg. Accessed September 21, 2020. http://hdl.handle.net/10210/2465.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Ras, Charl John. “λd,1-Minimal trees and full colorability of some classes of graphs.” 2009. Web. 21 Sep 2020.

Vancouver:

Ras CJ. λd,1-Minimal trees and full colorability of some classes of graphs. [Internet] [Thesis]. University of Johannesburg; 2009. [cited 2020 Sep 21]. Available from: http://hdl.handle.net/10210/2465.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Ras CJ. λd,1-Minimal trees and full colorability of some classes of graphs. [Thesis]. University of Johannesburg; 2009. Available from: http://hdl.handle.net/10210/2465

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Cambridge

22. Garrod, Bryn James. Problems of optimal choice on posets and generalizations of acyclic colourings.

Degree: PhD, 2011, University of Cambridge

 NOTE : The mathematical symbols in the abstract do not always display correctly in this text field. Please see the abstract in the thesis for… (more)

Subjects/Keywords: Partially ordered sets; Graph theory; Graph coloring; Secretary problem (Probability theory)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Garrod, B. J. (2011). Problems of optimal choice on posets and generalizations of acyclic colourings. (Doctoral Dissertation). University of Cambridge. Retrieved from http://www.dspace.cam.ac.uk/handle/1810/243496https://www.repository.cam.ac.uk/bitstream/1810/243496/2/license.txt ; https://www.repository.cam.ac.uk/bitstream/1810/243496/5/GarrodThesis.pdf.txt ; https://www.repository.cam.ac.uk/bitstream/1810/243496/3/GarrodThesis.pdf.txt ; https://www.repository.cam.ac.uk/bitstream/1810/243496/6/GarrodThesis.pdf.jpg

Chicago Manual of Style (16th Edition):

Garrod, Bryn James. “Problems of optimal choice on posets and generalizations of acyclic colourings.” 2011. Doctoral Dissertation, University of Cambridge. Accessed September 21, 2020. http://www.dspace.cam.ac.uk/handle/1810/243496https://www.repository.cam.ac.uk/bitstream/1810/243496/2/license.txt ; https://www.repository.cam.ac.uk/bitstream/1810/243496/5/GarrodThesis.pdf.txt ; https://www.repository.cam.ac.uk/bitstream/1810/243496/3/GarrodThesis.pdf.txt ; https://www.repository.cam.ac.uk/bitstream/1810/243496/6/GarrodThesis.pdf.jpg.

MLA Handbook (7th Edition):

Garrod, Bryn James. “Problems of optimal choice on posets and generalizations of acyclic colourings.” 2011. Web. 21 Sep 2020.

Vancouver:

Garrod BJ. Problems of optimal choice on posets and generalizations of acyclic colourings. [Internet] [Doctoral dissertation]. University of Cambridge; 2011. [cited 2020 Sep 21]. Available from: http://www.dspace.cam.ac.uk/handle/1810/243496https://www.repository.cam.ac.uk/bitstream/1810/243496/2/license.txt ; https://www.repository.cam.ac.uk/bitstream/1810/243496/5/GarrodThesis.pdf.txt ; https://www.repository.cam.ac.uk/bitstream/1810/243496/3/GarrodThesis.pdf.txt ; https://www.repository.cam.ac.uk/bitstream/1810/243496/6/GarrodThesis.pdf.jpg.

Council of Science Editors:

Garrod BJ. Problems of optimal choice on posets and generalizations of acyclic colourings. [Doctoral Dissertation]. University of Cambridge; 2011. Available from: http://www.dspace.cam.ac.uk/handle/1810/243496https://www.repository.cam.ac.uk/bitstream/1810/243496/2/license.txt ; https://www.repository.cam.ac.uk/bitstream/1810/243496/5/GarrodThesis.pdf.txt ; https://www.repository.cam.ac.uk/bitstream/1810/243496/3/GarrodThesis.pdf.txt ; https://www.repository.cam.ac.uk/bitstream/1810/243496/6/GarrodThesis.pdf.jpg

23. Brady, Matthew. The Four Color Theorem: A Possible New Approach.

Degree: MS, Mathematics, 2016, Governors State University

  The goal of this thesis is to explore the topic of graph coloring and expand on existing ideas in the field of Graph Theory.… (more)

Subjects/Keywords: 4 – color theorem; graph coloring; graph theory; Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Brady, M. (2016). The Four Color Theorem: A Possible New Approach. (Thesis). Governors State University. Retrieved from https://opus.govst.edu/theses/87

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Brady, Matthew. “The Four Color Theorem: A Possible New Approach.” 2016. Thesis, Governors State University. Accessed September 21, 2020. https://opus.govst.edu/theses/87.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Brady, Matthew. “The Four Color Theorem: A Possible New Approach.” 2016. Web. 21 Sep 2020.

Vancouver:

Brady M. The Four Color Theorem: A Possible New Approach. [Internet] [Thesis]. Governors State University; 2016. [cited 2020 Sep 21]. Available from: https://opus.govst.edu/theses/87.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Brady M. The Four Color Theorem: A Possible New Approach. [Thesis]. Governors State University; 2016. Available from: https://opus.govst.edu/theses/87

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Notre Dame

24. John Engbers. Some problems involving H-colorings of graphs</h1>.

Degree: Mathematics, 2013, University of Notre Dame

  For graphs G and H , an H -coloring of G, or homomorphism from G to H , is an edge-preserving map from the… (more)

Subjects/Keywords: graph homomorphism; graph theory; proper coloring; independent set

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Engbers, J. (2013). Some problems involving H-colorings of graphs</h1>. (Thesis). University of Notre Dame. Retrieved from https://curate.nd.edu/show/9s161546c7g

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Engbers, John. “Some problems involving H-colorings of graphs</h1>.” 2013. Thesis, University of Notre Dame. Accessed September 21, 2020. https://curate.nd.edu/show/9s161546c7g.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Engbers, John. “Some problems involving H-colorings of graphs</h1>.” 2013. Web. 21 Sep 2020.

Vancouver:

Engbers J. Some problems involving H-colorings of graphs</h1>. [Internet] [Thesis]. University of Notre Dame; 2013. [cited 2020 Sep 21]. Available from: https://curate.nd.edu/show/9s161546c7g.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Engbers J. Some problems involving H-colorings of graphs</h1>. [Thesis]. University of Notre Dame; 2013. Available from: https://curate.nd.edu/show/9s161546c7g

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Illinois – Urbana-Champaign

25. Kim, Jaehoon. Extremal problems involving forbidden subgraphs.

Degree: PhD, 0439, 2014, University of Illinois – Urbana-Champaign

 In this thesis, we study extremal problems involving forbidden subgraphs. We are interested in extremal problems over a family of graphs or over a family… (more)

Subjects/Keywords: Extremal Graph Theory; Graphs; Graph Coloring; Hypergraphs; Forbidden Subgraphs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kim, J. (2014). Extremal problems involving forbidden subgraphs. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/49480

Chicago Manual of Style (16th Edition):

Kim, Jaehoon. “Extremal problems involving forbidden subgraphs.” 2014. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed September 21, 2020. http://hdl.handle.net/2142/49480.

MLA Handbook (7th Edition):

Kim, Jaehoon. “Extremal problems involving forbidden subgraphs.” 2014. Web. 21 Sep 2020.

Vancouver:

Kim J. Extremal problems involving forbidden subgraphs. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2014. [cited 2020 Sep 21]. Available from: http://hdl.handle.net/2142/49480.

Council of Science Editors:

Kim J. Extremal problems involving forbidden subgraphs. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2014. Available from: http://hdl.handle.net/2142/49480

26. Loeb, Sarah Jane. Coloring and covering problems on graphs.

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

 The \emph{separation dimension} of a graph G, written π(G), is the minimum number of linear orderings of V(G) such that every two nonincident edges are… (more)

Subjects/Keywords: Graph coloring; Graph covering

…constructed a planar graph with no acyclic 4-coloring (and so, in particular, no star 4… …and Matthew Yancey. 1.3 3-Dynamic coloring of planar and toroidal graphs For a graph G… …of list coloring. For further work, see [1, 23, 24]. A graph G is r-dynamically L… …Thus we can think of r-dynamic coloring as bridging the gap between coloring a graph and… …planar subcubic graph G. Cranston and Kim [17] studied the list coloring version and… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Loeb, S. J. (2017). Coloring and covering problems on graphs. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/98358

Chicago Manual of Style (16th Edition):

Loeb, Sarah Jane. “Coloring and covering problems on graphs.” 2017. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed September 21, 2020. http://hdl.handle.net/2142/98358.

MLA Handbook (7th Edition):

Loeb, Sarah Jane. “Coloring and covering problems on graphs.” 2017. Web. 21 Sep 2020.

Vancouver:

Loeb SJ. Coloring and covering problems on graphs. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2017. [cited 2020 Sep 21]. Available from: http://hdl.handle.net/2142/98358.

Council of Science Editors:

Loeb SJ. Coloring and covering problems on graphs. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2017. Available from: http://hdl.handle.net/2142/98358


University of Waterloo

27. Romero Barbosa, Julian. Applied Hilbert's Nullstellensatz for Combinatorial Problems.

Degree: 2016, University of Waterloo

 Various feasibility problems in Combinatorial Optimization can be stated using systems of polynomial equations. Determining the existence of a it{stable set} of a given size,… (more)

Subjects/Keywords: Algebraic Geometry; Combinatorial Optimization; Hilbert's Nullstellensatz; Graph Coloring; Graph Theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Romero Barbosa, J. (2016). Applied Hilbert's Nullstellensatz for Combinatorial Problems. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/10897

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Romero Barbosa, Julian. “Applied Hilbert's Nullstellensatz for Combinatorial Problems.” 2016. Thesis, University of Waterloo. Accessed September 21, 2020. http://hdl.handle.net/10012/10897.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Romero Barbosa, Julian. “Applied Hilbert's Nullstellensatz for Combinatorial Problems.” 2016. Web. 21 Sep 2020.

Vancouver:

Romero Barbosa J. Applied Hilbert's Nullstellensatz for Combinatorial Problems. [Internet] [Thesis]. University of Waterloo; 2016. [cited 2020 Sep 21]. Available from: http://hdl.handle.net/10012/10897.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Romero Barbosa J. Applied Hilbert's Nullstellensatz for Combinatorial Problems. [Thesis]. University of Waterloo; 2016. Available from: http://hdl.handle.net/10012/10897

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Virginia Commonwealth University

28. Jaeger, Robert. Coloring the Square of Planar Graphs Without 4-Cycles or 5-Cycles.

Degree: MS, Mathematical Sciences, 2015, Virginia Commonwealth University

  The famous Four Color Theorem states that any planar graph can be properly colored using at most four colors. However, if we want to… (more)

Subjects/Keywords: Graph Coloring; Graph Square; Planar Graph; 4-Cycle; 5-Cycle; List Coloring; Discrete Mathematics and Combinatorics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Jaeger, R. (2015). Coloring the Square of Planar Graphs Without 4-Cycles or 5-Cycles. (Thesis). Virginia Commonwealth University. Retrieved from https://doi.org/10.25772/0GP2-EM46 ; https://scholarscompass.vcu.edu/etd/3816

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Jaeger, Robert. “Coloring the Square of Planar Graphs Without 4-Cycles or 5-Cycles.” 2015. Thesis, Virginia Commonwealth University. Accessed September 21, 2020. https://doi.org/10.25772/0GP2-EM46 ; https://scholarscompass.vcu.edu/etd/3816.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Jaeger, Robert. “Coloring the Square of Planar Graphs Without 4-Cycles or 5-Cycles.” 2015. Web. 21 Sep 2020.

Vancouver:

Jaeger R. Coloring the Square of Planar Graphs Without 4-Cycles or 5-Cycles. [Internet] [Thesis]. Virginia Commonwealth University; 2015. [cited 2020 Sep 21]. Available from: https://doi.org/10.25772/0GP2-EM46 ; https://scholarscompass.vcu.edu/etd/3816.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Jaeger R. Coloring the Square of Planar Graphs Without 4-Cycles or 5-Cycles. [Thesis]. Virginia Commonwealth University; 2015. Available from: https://doi.org/10.25772/0GP2-EM46 ; https://scholarscompass.vcu.edu/etd/3816

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Western Michigan University

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

Degree: PhD, Mathematics, 2017, Western Michigan University

  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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

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

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

MLA Handbook (7th Edition):

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

Vancouver:

Bi Z. Highly Hamiltonian Graphs and Digraphs. [Internet] [Doctoral dissertation]. Western Michigan University; 2017. [cited 2020 Sep 21]. 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

  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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

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

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

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

Vancouver:

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

Note: this citation may be lacking information needed for this citation format:
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

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

[1] [2] [3] [4] [5] [6]

.