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

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


University of Illinois – Urbana-Champaign

1. 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 August 04, 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. 04 Aug 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 Aug 04]. 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

2. Gastineau, Nicolas. Partitionnement, recouvrement et colorabilité dans les graphes : Partitionability, coverability and colorability in graphs.

Degree: Docteur es, Informatique, 2014, Université de Bourgogne

Nos recherches traitent de coloration de graphes avec des contraintes de distance (coloration de packing) ou des contraintes sur le voisinage (coloration de Grundy). Soit… (more)

Subjects/Keywords: Coloration; Coloration de Grundy; Complexité algorithmique; Complexité paramétrée; Distance; Graphe; Graphe régulier; Coloration de packing; S-coloration de packing; Coloring; Combinatorics; Computational complexity; Distance; Domination; Graph; Regular graph; Grundy coloring; Lattic; Packing coloring; Parameterized complexity; S -packing coloring; 004.6

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Gastineau, N. (2014). Partitionnement, recouvrement et colorabilité dans les graphes : Partitionability, coverability and colorability in graphs. (Doctoral Dissertation). Université de Bourgogne. Retrieved from http://www.theses.fr/2014DIJOS014

Chicago Manual of Style (16th Edition):

Gastineau, Nicolas. “Partitionnement, recouvrement et colorabilité dans les graphes : Partitionability, coverability and colorability in graphs.” 2014. Doctoral Dissertation, Université de Bourgogne. Accessed August 04, 2020. http://www.theses.fr/2014DIJOS014.

MLA Handbook (7th Edition):

Gastineau, Nicolas. “Partitionnement, recouvrement et colorabilité dans les graphes : Partitionability, coverability and colorability in graphs.” 2014. Web. 04 Aug 2020.

Vancouver:

Gastineau N. Partitionnement, recouvrement et colorabilité dans les graphes : Partitionability, coverability and colorability in graphs. [Internet] [Doctoral dissertation]. Université de Bourgogne; 2014. [cited 2020 Aug 04]. Available from: http://www.theses.fr/2014DIJOS014.

Council of Science Editors:

Gastineau N. Partitionnement, recouvrement et colorabilité dans les graphes : Partitionability, coverability and colorability in graphs. [Doctoral Dissertation]. Université de Bourgogne; 2014. Available from: http://www.theses.fr/2014DIJOS014

3. Stocker, Christopher J. Covering and packing problems on graphs and hypergraphs.

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

 In this thesis we consider several extremal problems for graphs and hypergraphs: packing, domination, and coloring. Graph packing problems have many applications to areas such… (more)

Subjects/Keywords: Packing; Domination; Acyclic Coloring

…with A. V. Kostochka [17]. 1.4 Acyclic Coloring A proper coloring of a graph G… …may think of the traditional vertex coloring problem as a type of covering problem. In… …number. The notion of acyclic coloring was introduced in 1973 by Gr¨ unbaum [12] and… …turned out to be interesting and closely connected to a number of other ideas in graph coloring… …Gr¨ unbaum proved that every planar graph has an acyclic 9-coloring and conjectured that… 

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

Stocker, C. J. (2011). Covering and packing problems on graphs and hypergraphs. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/26316

Chicago Manual of Style (16th Edition):

Stocker, Christopher J. “Covering and packing problems on graphs and hypergraphs.” 2011. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed August 04, 2020. http://hdl.handle.net/2142/26316.

MLA Handbook (7th Edition):

Stocker, Christopher J. “Covering and packing problems on graphs and hypergraphs.” 2011. Web. 04 Aug 2020.

Vancouver:

Stocker CJ. Covering and packing problems on graphs and hypergraphs. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2011. [cited 2020 Aug 04]. Available from: http://hdl.handle.net/2142/26316.

Council of Science Editors:

Stocker CJ. Covering and packing problems on graphs and hypergraphs. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2011. Available from: http://hdl.handle.net/2142/26316

4. Jeromel, Anže. (d, n)-pakirno barvanje za posplošene grafe Sierpińskega.

Degree: 2019, Univerza v Mariboru

V magistrski nalogi so opisani grafi Sierpińskega in njihove posplošitve, (d, n)-pakirno barvanje grafov ter računsko iskanje (d, n)-pakirnih kromatičnih števil. Razvili smo algoritem za… (more)

Subjects/Keywords: Sierpiński; pakirno barvanje; pakirno kromatično število; Sierpiński; packing coloring; packing chromatic number; info:eu-repo/classification/udc/004.94:004.83(043.2)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Jeromel, A. (2019). (d, n)-pakirno barvanje za posplošene grafe Sierpińskega. (Masters Thesis). Univerza v Mariboru. Retrieved from https://dk.um.si/IzpisGradiva.php?id=73544 ; https://dk.um.si/Dokument.php?id=133889&dn= ; https://plus.si.cobiss.net/opac7/bib/22488342?lang=sl

Chicago Manual of Style (16th Edition):

Jeromel, Anže. “(d, n)-pakirno barvanje za posplošene grafe Sierpińskega.” 2019. Masters Thesis, Univerza v Mariboru. Accessed August 04, 2020. https://dk.um.si/IzpisGradiva.php?id=73544 ; https://dk.um.si/Dokument.php?id=133889&dn= ; https://plus.si.cobiss.net/opac7/bib/22488342?lang=sl.

MLA Handbook (7th Edition):

Jeromel, Anže. “(d, n)-pakirno barvanje za posplošene grafe Sierpińskega.” 2019. Web. 04 Aug 2020.

Vancouver:

Jeromel A. (d, n)-pakirno barvanje za posplošene grafe Sierpińskega. [Internet] [Masters thesis]. Univerza v Mariboru; 2019. [cited 2020 Aug 04]. Available from: https://dk.um.si/IzpisGradiva.php?id=73544 ; https://dk.um.si/Dokument.php?id=133889&dn= ; https://plus.si.cobiss.net/opac7/bib/22488342?lang=sl.

Council of Science Editors:

Jeromel A. (d, n)-pakirno barvanje za posplošene grafe Sierpińskega. [Masters Thesis]. Univerza v Mariboru; 2019. Available from: https://dk.um.si/IzpisGradiva.php?id=73544 ; https://dk.um.si/Dokument.php?id=133889&dn= ; https://plus.si.cobiss.net/opac7/bib/22488342?lang=sl

5. Messerschmidt, Kacy. Coloring problems in graph theory.

Degree: 2018, Iowa State University

 In this thesis, we focus on variants of the coloring problem on graphs. A coloring of a graph G is an assignment of colors to… (more)

Subjects/Keywords: discrete mathematics; graph coloring; graph theory; packing coloring; Mathematics

packing colorings, improper colorings, and facial unique-maximum colorings. A packing coloring… …packing colorings. In Chapter 6, we deal with a type of improper coloring called a {0, p… …coloring Given a graph G, an i-packing is a set X ⊆ V (G) such that dist(u, v… …x29; > i for any u, v ∈ X. A packing k-coloring is a partition of V (G) into… …x28;c) shows an example of a packing 4-coloring of P3 P3 . The packing chromatic number… 

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

Messerschmidt, K. (2018). Coloring problems in graph theory. (Thesis). Iowa State University. Retrieved from https://lib.dr.iastate.edu/etd/16639

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

Messerschmidt, Kacy. “Coloring problems in graph theory.” 2018. Thesis, Iowa State University. Accessed August 04, 2020. https://lib.dr.iastate.edu/etd/16639.

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

MLA Handbook (7th Edition):

Messerschmidt, Kacy. “Coloring problems in graph theory.” 2018. Web. 04 Aug 2020.

Vancouver:

Messerschmidt K. Coloring problems in graph theory. [Internet] [Thesis]. Iowa State University; 2018. [cited 2020 Aug 04]. Available from: https://lib.dr.iastate.edu/etd/16639.

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

Council of Science Editors:

Messerschmidt K. Coloring problems in graph theory. [Thesis]. Iowa State University; 2018. Available from: https://lib.dr.iastate.edu/etd/16639

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

6. Mortada, Maidoun. The b-chromatic number of regular graphs : Le nombre b-chromatique de graphe régulier.

Degree: Docteur es, Informatique, 2013, Université Claude Bernard – Lyon I

Les deux problèmes majeurs considérés dans cette thèse : le b-coloration problème et le graphe emballage problème. 1. Le b-coloration problème : Une coloration des… (more)

Subjects/Keywords: Coloration de graphe; B-coloration; Nombre b-chromatique; Graphe régulier; Emballage de graphe; Emballage marqué de graphe; Graphe puissance; Arbre non-étoile; Graph coloring; B-coloring; B-chromatic number; Regular graph; Graph packing; Labeled packing of graph; Power graph; Non-star tree; 004.0151

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Mortada, M. (2013). The b-chromatic number of regular graphs : Le nombre b-chromatique de graphe régulier. (Doctoral Dissertation). Université Claude Bernard – Lyon I. Retrieved from http://www.theses.fr/2013LYO10116

Chicago Manual of Style (16th Edition):

Mortada, Maidoun. “The b-chromatic number of regular graphs : Le nombre b-chromatique de graphe régulier.” 2013. Doctoral Dissertation, Université Claude Bernard – Lyon I. Accessed August 04, 2020. http://www.theses.fr/2013LYO10116.

MLA Handbook (7th Edition):

Mortada, Maidoun. “The b-chromatic number of regular graphs : Le nombre b-chromatique de graphe régulier.” 2013. Web. 04 Aug 2020.

Vancouver:

Mortada M. The b-chromatic number of regular graphs : Le nombre b-chromatique de graphe régulier. [Internet] [Doctoral dissertation]. Université Claude Bernard – Lyon I; 2013. [cited 2020 Aug 04]. Available from: http://www.theses.fr/2013LYO10116.

Council of Science Editors:

Mortada M. The b-chromatic number of regular graphs : Le nombre b-chromatique de graphe régulier. [Doctoral Dissertation]. Université Claude Bernard – Lyon I; 2013. Available from: http://www.theses.fr/2013LYO10116

7. Khan, Arindam. Approximation algorithms for multidimensional bin packing.

Degree: PhD, Computer Science, 2015, Georgia Tech

 The bin packing problem has been the corner stone of approximation algorithms and has been extensively studied starting from the early seventies. In the classical… (more)

Subjects/Keywords: Scheduling; Theoretical computer science; Approximation algorithms; Bin packing; Bipartite edge coloring; Geometric packing; Vector packing

…for Edge Coloring Weighted Bipartite Graphs . . . . . . . 135 x SUMMARY The bin packing… …packing and weighted bipartite edge coloring. In two-dimensional (2-D) geometric bin… …packing, vector bin packing and weighted bipartite edge coloring. In two-dimensional (2-D… …generalization of two classical optimization problems: bin packing and bipartite edge coloring problem… …bin packing. In Chapter 5 we cover weighted bipartite edge coloring. We conclude in Chapter… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Khan, A. (2015). Approximation algorithms for multidimensional bin packing. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/54371

Chicago Manual of Style (16th Edition):

Khan, Arindam. “Approximation algorithms for multidimensional bin packing.” 2015. Doctoral Dissertation, Georgia Tech. Accessed August 04, 2020. http://hdl.handle.net/1853/54371.

MLA Handbook (7th Edition):

Khan, Arindam. “Approximation algorithms for multidimensional bin packing.” 2015. Web. 04 Aug 2020.

Vancouver:

Khan A. Approximation algorithms for multidimensional bin packing. [Internet] [Doctoral dissertation]. Georgia Tech; 2015. [cited 2020 Aug 04]. Available from: http://hdl.handle.net/1853/54371.

Council of Science Editors:

Khan A. Approximation algorithms for multidimensional bin packing. [Doctoral Dissertation]. Georgia Tech; 2015. Available from: http://hdl.handle.net/1853/54371

8. Moss, Kevin. Coloring problems in graph theory.

Degree: 2017, Iowa State University

 We consider two branches of coloring problems for graphs: list coloring and packing coloring. We introduce a new variation to list coloring which we call… (more)

Subjects/Keywords: Choosability; Combinatorics; Graph Coloring; Graph Theory; Packing Coloring; Computer Sciences; Mathematics

…problems for graphs: list coloring and packing coloring. We introduce a new variation to list… …8 1.3.4 Packing Coloring As a departure from list coloring, another variant is packing… …coloring. A k-packing coloring of a graph G is a color assignment c such that c(u) = c… …χp (G), is the smallest k such that G admits a valid k-packing coloring. Packing… …term was later changed to packing coloring by Brešar, Klavžar, and Rall [6]… 

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

Moss, K. (2017). Coloring problems in graph theory. (Thesis). Iowa State University. Retrieved from https://lib.dr.iastate.edu/etd/15383

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

Moss, Kevin. “Coloring problems in graph theory.” 2017. Thesis, Iowa State University. Accessed August 04, 2020. https://lib.dr.iastate.edu/etd/15383.

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

MLA Handbook (7th Edition):

Moss, Kevin. “Coloring problems in graph theory.” 2017. Web. 04 Aug 2020.

Vancouver:

Moss K. Coloring problems in graph theory. [Internet] [Thesis]. Iowa State University; 2017. [cited 2020 Aug 04]. Available from: https://lib.dr.iastate.edu/etd/15383.

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

Council of Science Editors:

Moss K. Coloring problems in graph theory. [Thesis]. Iowa State University; 2017. Available from: https://lib.dr.iastate.edu/etd/15383

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

9. Tahraoui, Mohammed Amin. Coloring, packing and embedding of graphs : Coloration, placement et plongement de graphes.

Degree: Docteur es, Informatique, 2012, Université Claude Bernard – Lyon I

Cette thèse se situe dans le domaine de graphes et de leurs applications, Elleest constitué de trois grandes parties, la première est consacrée à l’étude… (more)

Subjects/Keywords: Théorie des graphes; Graphes étiquetés; Colorations sommets distinguantes; Placement de graphes étiquetés; Appariement exact des documents XML; Graph theory; Labeled graph; Vertex-distinguishing edge coloring; Labeled packing of graphs; XML tree pattern matching; 004.015 1

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Tahraoui, M. A. (2012). Coloring, packing and embedding of graphs : Coloration, placement et plongement de graphes. (Doctoral Dissertation). Université Claude Bernard – Lyon I. Retrieved from http://www.theses.fr/2012LYO10278

Chicago Manual of Style (16th Edition):

Tahraoui, Mohammed Amin. “Coloring, packing and embedding of graphs : Coloration, placement et plongement de graphes.” 2012. Doctoral Dissertation, Université Claude Bernard – Lyon I. Accessed August 04, 2020. http://www.theses.fr/2012LYO10278.

MLA Handbook (7th Edition):

Tahraoui, Mohammed Amin. “Coloring, packing and embedding of graphs : Coloration, placement et plongement de graphes.” 2012. Web. 04 Aug 2020.

Vancouver:

Tahraoui MA. Coloring, packing and embedding of graphs : Coloration, placement et plongement de graphes. [Internet] [Doctoral dissertation]. Université Claude Bernard – Lyon I; 2012. [cited 2020 Aug 04]. Available from: http://www.theses.fr/2012LYO10278.

Council of Science Editors:

Tahraoui MA. Coloring, packing and embedding of graphs : Coloration, placement et plongement de graphes. [Doctoral Dissertation]. Université Claude Bernard – Lyon I; 2012. Available from: http://www.theses.fr/2012LYO10278

.