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:(list coloring). Showing records 1 – 15 of 15 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


Iowa State University

1. 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 April 06, 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. 06 Apr 2020.

Vancouver:

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


University of Waterloo

2. 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 April 06, 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. 06 Apr 2020.

Vancouver:

Kelly T. Cliques, Degrees, and Coloring: Expanding the ω, Δ, χ paradigm. [Internet] [Thesis]. University of Waterloo; 2019. [cited 2020 Apr 06]. 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

3. 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 April 06, 2020. http://hdl.handle.net/2142/87975.

MLA Handbook (7th Edition):

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

Vancouver:

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

4. Kumbhat, Mohit. Colorings and list colorings of graphs and hypergraphs.

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

 In this thesis we study some extremal problems related to colorings and list colorings of graphs and hypergraphs. One of the main problems that we… (more)

Subjects/Keywords: Graph Coloring; List Coloring; Hypergraphs

…the list chromatic number of graphs. A rainbow coloring is a coloring of the vertices such… …asz. These results for simple hypergraphs hold for list coloring as well. 3. We again… …The proof works also for list coloring. A remarkable feature of this result is that it works… …component has two vertices. A t-coloring of a graph is a labeling of its vertices from a set S of… …size t. A proper t-coloring of a graph is a t-coloring such that adjacent vertices are… 

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kumbhat, M. (2012). Colorings and list colorings of graphs and hypergraphs. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/30921

Chicago Manual of Style (16th Edition):

Kumbhat, Mohit. “Colorings and list colorings of graphs and hypergraphs.” 2012. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed April 06, 2020. http://hdl.handle.net/2142/30921.

MLA Handbook (7th Edition):

Kumbhat, Mohit. “Colorings and list colorings of graphs and hypergraphs.” 2012. Web. 06 Apr 2020.

Vancouver:

Kumbhat M. Colorings and list colorings of graphs and hypergraphs. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2012. [cited 2020 Apr 06]. Available from: http://hdl.handle.net/2142/30921.

Council of Science Editors:

Kumbhat M. Colorings and list colorings of graphs and hypergraphs. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2012. Available from: http://hdl.handle.net/2142/30921


University of Illinois – Urbana-Champaign

5. Kantor, Ida. Graphs, codes, and colorings.

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

 \noindent{This thesis focuses on topics in extremal combinatorics.} Given an integer-valued function f defined on the vertices of a graph G, we say G is… (more)

Subjects/Keywords: sum choice number; list coloring; product dimension; graph representation; codes

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kantor, I. (2011). Graphs, codes, and colorings. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/18247

Chicago Manual of Style (16th Edition):

Kantor, Ida. “Graphs, codes, and colorings.” 2011. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed April 06, 2020. http://hdl.handle.net/2142/18247.

MLA Handbook (7th Edition):

Kantor, Ida. “Graphs, codes, and colorings.” 2011. Web. 06 Apr 2020.

Vancouver:

Kantor I. Graphs, codes, and colorings. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2011. [cited 2020 Apr 06]. Available from: http://hdl.handle.net/2142/18247.

Council of Science Editors:

Kantor I. Graphs, codes, and colorings. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2011. Available from: http://hdl.handle.net/2142/18247

6. Xu, Renyu. Quelques problèmes de coloration du graphe : Some coloring problems of graphs.

Degree: Docteur es, Informatique, 2017, Université Paris-Saclay (ComUE); Shandong University (Jinan, Chine)

Un k-coloriage total d'un graphe G est un coloriage de V(G)cup E(G) utilisant (1,2,…,k) couleurs tel qu'aucune paire d'éléments adjacents ou incidents ne reçoivent la… (more)

Subjects/Keywords: Coloration totale; Coloration par liste; Coloriage total somme-Des-Voisins-Distinguant; Arboricité linéaire L-Déterminable; Total coloring; List coloring; Neighbor sum distinguish coloring; List linear arboricityist linear arboricity

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Xu, R. (2017). Quelques problèmes de coloration du graphe : Some coloring problems of graphs. (Doctoral Dissertation). Université Paris-Saclay (ComUE); Shandong University (Jinan, Chine). Retrieved from http://www.theses.fr/2017SACLS104

Chicago Manual of Style (16th Edition):

Xu, Renyu. “Quelques problèmes de coloration du graphe : Some coloring problems of graphs.” 2017. Doctoral Dissertation, Université Paris-Saclay (ComUE); Shandong University (Jinan, Chine). Accessed April 06, 2020. http://www.theses.fr/2017SACLS104.

MLA Handbook (7th Edition):

Xu, Renyu. “Quelques problèmes de coloration du graphe : Some coloring problems of graphs.” 2017. Web. 06 Apr 2020.

Vancouver:

Xu R. Quelques problèmes de coloration du graphe : Some coloring problems of graphs. [Internet] [Doctoral dissertation]. Université Paris-Saclay (ComUE); Shandong University (Jinan, Chine); 2017. [cited 2020 Apr 06]. Available from: http://www.theses.fr/2017SACLS104.

Council of Science Editors:

Xu R. Quelques problèmes de coloration du graphe : Some coloring problems of graphs. [Doctoral Dissertation]. Université Paris-Saclay (ComUE); Shandong University (Jinan, Chine); 2017. Available from: http://www.theses.fr/2017SACLS104

7. Levit, Maxwell. Extensions of Galvin's Theorem.

Degree: 2018, University of Waterloo

 We discuss problems in list coloring with an emphasis on techniques that utilize oriented graphs. Our central theme is Galvin's resolution of the Dinitz problem… (more)

Subjects/Keywords: Graph Coloring; List Coloring; Galvin's Theorem

…account of list coloring in a Russian journal. His work had not reached Erdös, Rubin, and… …Taylor by 1979, when the trio introduced the notion of list coloring to the English speaking… …in list coloring. See [42], [15]. Probably the most infamous such… …problem is the so called edge list coloring conjecture. This conjecture asserts that the… …Tarsi to show that the edge list coloring conjecture is true for the line graphs of complete… 

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Levit, M. (2018). Extensions of Galvin's Theorem. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/13211

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

Levit, Maxwell. “Extensions of Galvin's Theorem.” 2018. Thesis, University of Waterloo. Accessed April 06, 2020. http://hdl.handle.net/10012/13211.

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

MLA Handbook (7th Edition):

Levit, Maxwell. “Extensions of Galvin's Theorem.” 2018. Web. 06 Apr 2020.

Vancouver:

Levit M. Extensions of Galvin's Theorem. [Internet] [Thesis]. University of Waterloo; 2018. [cited 2020 Apr 06]. Available from: http://hdl.handle.net/10012/13211.

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

Council of Science Editors:

Levit M. Extensions of Galvin's Theorem. [Thesis]. University of Waterloo; 2018. Available from: http://hdl.handle.net/10012/13211

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


Virginia Commonwealth University

8. 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 April 06, 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. 06 Apr 2020.

Vancouver:

Jaeger R. Coloring the Square of Planar Graphs Without 4-Cycles or 5-Cycles. [Internet] [Thesis]. Virginia Commonwealth University; 2015. [cited 2020 Apr 06]. 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


Virginia Tech

9. Baber, Courtney Leigh. An Introduction to List Colorings of Graphs.

Degree: MS, Mathematics, 2009, Virginia Tech

 One of the most popular and useful areas of graph theory is graph colorings. A graph coloring is an assignment of integers to the vertices… (more)

Subjects/Keywords: channel assignment problem; list coloring; graph

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Baber, C. L. (2009). An Introduction to List Colorings of Graphs. (Masters Thesis). Virginia Tech. Retrieved from http://hdl.handle.net/10919/33484

Chicago Manual of Style (16th Edition):

Baber, Courtney Leigh. “An Introduction to List Colorings of Graphs.” 2009. Masters Thesis, Virginia Tech. Accessed April 06, 2020. http://hdl.handle.net/10919/33484.

MLA Handbook (7th Edition):

Baber, Courtney Leigh. “An Introduction to List Colorings of Graphs.” 2009. Web. 06 Apr 2020.

Vancouver:

Baber CL. An Introduction to List Colorings of Graphs. [Internet] [Masters thesis]. Virginia Tech; 2009. [cited 2020 Apr 06]. Available from: http://hdl.handle.net/10919/33484.

Council of Science Editors:

Baber CL. An Introduction to List Colorings of Graphs. [Masters Thesis]. Virginia Tech; 2009. Available from: http://hdl.handle.net/10919/33484


University of Illinois – Urbana-Champaign

10. Puleo, Gregory. Problems in list coloring, triangle covering, and pursuit-evasion games.

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

 We study several problems in extremal graph theory. Chapter 2 studies Tuza's Conjecture, which states that if a graph G does not contain more than… (more)

Subjects/Keywords: Tuza's conjecture; packing and covering; list coloring; pursuit-evasion games; discharging; triangle packing; triangle covering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Puleo, G. (2014). Problems in list coloring, triangle covering, and pursuit-evasion games. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/50548

Chicago Manual of Style (16th Edition):

Puleo, Gregory. “Problems in list coloring, triangle covering, and pursuit-evasion games.” 2014. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed April 06, 2020. http://hdl.handle.net/2142/50548.

MLA Handbook (7th Edition):

Puleo, Gregory. “Problems in list coloring, triangle covering, and pursuit-evasion games.” 2014. Web. 06 Apr 2020.

Vancouver:

Puleo G. Problems in list coloring, triangle covering, and pursuit-evasion games. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2014. [cited 2020 Apr 06]. Available from: http://hdl.handle.net/2142/50548.

Council of Science Editors:

Puleo G. Problems in list coloring, triangle covering, and pursuit-evasion games. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2014. Available from: http://hdl.handle.net/2142/50548

11. Postle, Luke Jamison. 5-list-coloring graphs on surfaces.

Degree: PhD, Mathematics, 2012, Georgia Tech

 Thomassen proved that there are only finitely many 6-critical graphs embeddable on a fixed surface. He also showed that planar graphs are 5-list-colorable. This thesis… (more)

Subjects/Keywords: Graph coloring; List-coloring; Choosability; Graph theory; Graph coloring

Coloring . . . . . . . . . . . . . . . . . . . . . 226 5.8.1 5.8.2 5.9 Finitely Many 6-List… …develops new techniques to prove general theorems for 5-list-coloring graphs embedded in a fixed… …regards to 5-coloring. In Section 1.4, we introduce list-coloring and begin to examine the… …history of 5-list-coloring graphs on surfaces. In Section 1.5, 1.6 and 1.7 we review results… …about extending colorings of precolored subgraphs, 5-list-coloring graphs with crossings, and… 

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Postle, L. J. (2012). 5-list-coloring graphs on surfaces. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/45807

Chicago Manual of Style (16th Edition):

Postle, Luke Jamison. “5-list-coloring graphs on surfaces.” 2012. Doctoral Dissertation, Georgia Tech. Accessed April 06, 2020. http://hdl.handle.net/1853/45807.

MLA Handbook (7th Edition):

Postle, Luke Jamison. “5-list-coloring graphs on surfaces.” 2012. Web. 06 Apr 2020.

Vancouver:

Postle LJ. 5-list-coloring graphs on surfaces. [Internet] [Doctoral dissertation]. Georgia Tech; 2012. [cited 2020 Apr 06]. Available from: http://hdl.handle.net/1853/45807.

Council of Science Editors:

Postle LJ. 5-list-coloring graphs on surfaces. [Doctoral Dissertation]. Georgia Tech; 2012. Available from: http://hdl.handle.net/1853/45807

12. Mahoney, Thomas R. Online choosability of graphs.

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

 We study several problems in graph coloring. In list coloring, each vertex v has a set L(v) of available colors and must be assigned a… (more)

Subjects/Keywords: graph coloring; list coloring; choosability; paintability; online list coloring; online choosability

…x28;called its list) of available colors. We seek a proper coloring φ such that φ(… …studied this problem under the names list coloring and choosability. Given a graph G and a… …Given a list assignment with colors from N, suppose that on round i, the coloring algorithm… …choosable if a g-fold coloring can be chosen from any list assignment L satisfying |L(v)… …disjoint union. 10 Chapter 2 Online Choosability The list version of graph coloring… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Mahoney, T. R. (2015). Online choosability of graphs. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/88001

Chicago Manual of Style (16th Edition):

Mahoney, Thomas R. “Online choosability of graphs.” 2015. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed April 06, 2020. http://hdl.handle.net/2142/88001.

MLA Handbook (7th Edition):

Mahoney, Thomas R. “Online choosability of graphs.” 2015. Web. 06 Apr 2020.

Vancouver:

Mahoney TR. Online choosability of graphs. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2015. [cited 2020 Apr 06]. Available from: http://hdl.handle.net/2142/88001.

Council of Science Editors:

Mahoney TR. Online choosability of graphs. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2015. Available from: http://hdl.handle.net/2142/88001

13. Pastor, Lucas. Coloration, ensemble indépendant et structure de graphe : Coloring, stable set and structure of graphs.

Degree: Docteur es, Mathématiques et informatique, 2017, Grenoble Alpes

Cette thèse traite de la coloration de graphe, de la coloration par liste,d'ensembles indépendants de poids maximum et de la théorie structurelle des graphes.Dans un… (more)

Subjects/Keywords: Théorie des graphes; Coloration; Coloration par listes; Ensemble indépendant; Algorithme; Théorie structurelle des graphes; Graph Theory; Coloring; List coloring; Stable set; Algorithm; Structural graph theory; 004

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Pastor, L. (2017). Coloration, ensemble indépendant et structure de graphe : Coloring, stable set and structure of graphs. (Doctoral Dissertation). Grenoble Alpes. Retrieved from http://www.theses.fr/2017GREAM071

Chicago Manual of Style (16th Edition):

Pastor, Lucas. “Coloration, ensemble indépendant et structure de graphe : Coloring, stable set and structure of graphs.” 2017. Doctoral Dissertation, Grenoble Alpes. Accessed April 06, 2020. http://www.theses.fr/2017GREAM071.

MLA Handbook (7th Edition):

Pastor, Lucas. “Coloration, ensemble indépendant et structure de graphe : Coloring, stable set and structure of graphs.” 2017. Web. 06 Apr 2020.

Vancouver:

Pastor L. Coloration, ensemble indépendant et structure de graphe : Coloring, stable set and structure of graphs. [Internet] [Doctoral dissertation]. Grenoble Alpes; 2017. [cited 2020 Apr 06]. Available from: http://www.theses.fr/2017GREAM071.

Council of Science Editors:

Pastor L. Coloration, ensemble indépendant et structure de graphe : Coloring, stable set and structure of graphs. [Doctoral Dissertation]. Grenoble Alpes; 2017. Available from: http://www.theses.fr/2017GREAM071

14. Choi, Ilkyoo. Extremal problems on variations of graph colorings.

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

 This thesis investigates various coloring problems in graph theory. Graph coloring is an essential part of combinatorics and discrete mathematics, as it deals with the… (more)

Subjects/Keywords: Graph Theory; Graph Coloring; Choosability; List Chromatic Number; Discharging

…of list coloring of graphs. A (k, d)-list assignment L of a graph G is a function… …x28;k, d)-choosable if there exists an L-coloring of G for every (k, d)-list… …colors for each v ∈ V (G). Given a list assignment L, an L-coloring (or an… …L-coloring whenever |L(v)| ≥ k for each vertex v. The list chromatic number of G… …Chapter 6 Improper Coloring of Planar Graphs . . . . 6.1 Introduction… 

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Choi, I. (2014). Extremal problems on variations of graph colorings. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/49578

Chicago Manual of Style (16th Edition):

Choi, Ilkyoo. “Extremal problems on variations of graph colorings.” 2014. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed April 06, 2020. http://hdl.handle.net/2142/49578.

MLA Handbook (7th Edition):

Choi, Ilkyoo. “Extremal problems on variations of graph colorings.” 2014. Web. 06 Apr 2020.

Vancouver:

Choi I. Extremal problems on variations of graph colorings. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2014. [cited 2020 Apr 06]. Available from: http://hdl.handle.net/2142/49578.

Council of Science Editors:

Choi I. Extremal problems on variations of graph colorings. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2014. Available from: http://hdl.handle.net/2142/49578

15. Bernshteyn, Anton. Coloring problems in combinatorics and descriptive set theory.

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

 In this dissertation we study problems related to colorings of combinatorial structures both in the “classical” finite context and in the framework of descriptive set… (more)

Subjects/Keywords: coloring; probabilistic method; Lovasz Local Lemma; graphs; hypergraphs; list coloring; DP-coloring; descriptive combinatorics; measurable dynamics; generic dynamics; symbolic dynamics; weak containment

…ERT79] introduced an important generalization of graph coloring called list coloring. In… …It is clear that ordinary graph coloring is a special case of list coloring (just make… …generalized list coloring further by allowing the identifications between the colors in the lists to… …colorable but not H2 -colorable. List coloring is a special case of DP-coloring (see Fig. 2… …In Chapter 2 we investigate how much of the classical theory of list coloring can be… 

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Bernshteyn, A. (2018). Coloring problems in combinatorics and descriptive set theory. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/101454

Chicago Manual of Style (16th Edition):

Bernshteyn, Anton. “Coloring problems in combinatorics and descriptive set theory.” 2018. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed April 06, 2020. http://hdl.handle.net/2142/101454.

MLA Handbook (7th Edition):

Bernshteyn, Anton. “Coloring problems in combinatorics and descriptive set theory.” 2018. Web. 06 Apr 2020.

Vancouver:

Bernshteyn A. Coloring problems in combinatorics and descriptive set theory. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2018. [cited 2020 Apr 06]. Available from: http://hdl.handle.net/2142/101454.

Council of Science Editors:

Bernshteyn A. Coloring problems in combinatorics and descriptive set theory. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2018. Available from: http://hdl.handle.net/2142/101454

.