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 Chromatic Number). Showing records 1 – 6 of 6 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters

1. Changiz Rezaei, Seyed Saeed. Entropy and Graphs.

Degree: 2014, University of Waterloo

 The entropy of a graph is a functional depending both on the graph itself and on a probability distribution on its vertex set. This graph… (more)

Subjects/Keywords: Entropy; Probability distribution; Graphs; Fractional Chromatic Number; Vertex packing polytope; Perfect Graphs; Line Graphs

…Entropy and Fractional Chromatic Number . . . . . . . . . . . . . . 28 3.7 Probability… …the the graph entropy and perfect graphs and fractional chromatic number of a graph. Chapter… …entropy of a graph with its fractional chromatic number in more detail. Furthermore, we obtain… …the fractional chromatic number of a vertex transitive graph using its properties along with… …chromatic number of F is denoted by χ(F ). Let T (n) = {U ⊆ V n : P n… 

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

Changiz Rezaei, S. S. (2014). Entropy and Graphs. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/8173

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

Changiz Rezaei, Seyed Saeed. “Entropy and Graphs.” 2014. Thesis, University of Waterloo. Accessed August 04, 2020. http://hdl.handle.net/10012/8173.

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

MLA Handbook (7th Edition):

Changiz Rezaei, Seyed Saeed. “Entropy and Graphs.” 2014. Web. 04 Aug 2020.

Vancouver:

Changiz Rezaei SS. Entropy and Graphs. [Internet] [Thesis]. University of Waterloo; 2014. [cited 2020 Aug 04]. Available from: http://hdl.handle.net/10012/8173.

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

Council of Science Editors:

Changiz Rezaei SS. Entropy and Graphs. [Thesis]. University of Waterloo; 2014. Available from: http://hdl.handle.net/10012/8173

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


University of South Carolina

2. Clifton, Ann Wells. The Packing Chromatic Number of Random d-regular Graphs.

Degree: MS, Mathematics, 2015, University of South Carolina

  Let G = (V (G),E(G)) be a simple graph of order n and let i be a positive integer. Xi superset V (G) is… (more)

Subjects/Keywords: Mathematics; Physical Sciences and Mathematics; Packing Chromatic Number; Random d-regular Graphs; Configuration model

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Clifton, A. W. (2015). The Packing Chromatic Number of Random d-regular Graphs. (Masters Thesis). University of South Carolina. Retrieved from https://scholarcommons.sc.edu/etd/3697

Chicago Manual of Style (16th Edition):

Clifton, Ann Wells. “The Packing Chromatic Number of Random d-regular Graphs.” 2015. Masters Thesis, University of South Carolina. Accessed August 04, 2020. https://scholarcommons.sc.edu/etd/3697.

MLA Handbook (7th Edition):

Clifton, Ann Wells. “The Packing Chromatic Number of Random d-regular Graphs.” 2015. Web. 04 Aug 2020.

Vancouver:

Clifton AW. The Packing Chromatic Number of Random d-regular Graphs. [Internet] [Masters thesis]. University of South Carolina; 2015. [cited 2020 Aug 04]. Available from: https://scholarcommons.sc.edu/etd/3697.

Council of Science Editors:

Clifton AW. The Packing Chromatic Number of Random d-regular Graphs. [Masters Thesis]. University of South Carolina; 2015. Available from: https://scholarcommons.sc.edu/etd/3697

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

4. Markuš, Žiga. Računalniško iskanje pakirnega kromatskega števila za različne neskončne mreže.

Degree: 2018, Univerza v Mariboru

Pojem pakirnega kromatskega števila prihaja iz področja načrtovanja frekvenc v brezžičnih omrežjih. Pri pakiranju k-barv grafa G, morajo biti vozlišča grafa z barvo i paroma… (more)

Subjects/Keywords: neskončne mreže; pakirno kromatsko število; grafi; lattice; packing chromatic number; graph; info:eu-repo/classification/udc/535.345.61:(043.2)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Markuš, . (2018). Računalniško iskanje pakirnega kromatskega števila za različne neskončne mreže. (Masters Thesis). Univerza v Mariboru. Retrieved from https://dk.um.si/IzpisGradiva.php?id=69322 ; https://dk.um.si/Dokument.php?id=121321&dn= ; https://dk.um.si/Dokument.php?id=121156&dn= ; https://plus.si.cobiss.net/opac7/bib/21135894?lang=sl

Chicago Manual of Style (16th Edition):

Markuš, Žiga. “Računalniško iskanje pakirnega kromatskega števila za različne neskončne mreže.” 2018. Masters Thesis, Univerza v Mariboru. Accessed August 04, 2020. https://dk.um.si/IzpisGradiva.php?id=69322 ; https://dk.um.si/Dokument.php?id=121321&dn= ; https://dk.um.si/Dokument.php?id=121156&dn= ; https://plus.si.cobiss.net/opac7/bib/21135894?lang=sl.

MLA Handbook (7th Edition):

Markuš, Žiga. “Računalniško iskanje pakirnega kromatskega števila za različne neskončne mreže.” 2018. Web. 04 Aug 2020.

Vancouver:

Markuš . Računalniško iskanje pakirnega kromatskega števila za različne neskončne mreže. [Internet] [Masters thesis]. Univerza v Mariboru; 2018. [cited 2020 Aug 04]. Available from: https://dk.um.si/IzpisGradiva.php?id=69322 ; https://dk.um.si/Dokument.php?id=121321&dn= ; https://dk.um.si/Dokument.php?id=121156&dn= ; https://plus.si.cobiss.net/opac7/bib/21135894?lang=sl.

Council of Science Editors:

Markuš . Računalniško iskanje pakirnega kromatskega števila za različne neskončne mreže. [Masters Thesis]. Univerza v Mariboru; 2018. Available from: https://dk.um.si/IzpisGradiva.php?id=69322 ; https://dk.um.si/Dokument.php?id=121321&dn= ; https://dk.um.si/Dokument.php?id=121156&dn= ; https://plus.si.cobiss.net/opac7/bib/21135894?lang=sl

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

6. Moustrou, Philippe. Geometric distance graphs, lattices and polytopes : Graphes métriques géométriques, réseaux et polytopes.

Degree: Docteur es, Mathématiques pures, 2017, Bordeaux

Un graphe métrique G(X;D) est un graphe dont l’ensemble des sommets est l’ensemble X des points d’un espace métrique (X; d), et dont les arêtes… (more)

Subjects/Keywords: Graphes métriques; Réseaux Euclidiens; Empilement de sphères; Borne de Minkowski-Hlawka; Codes linéaires; Polytopes pavant l’espace par translation; Nombre chromatique; Distance graphs; Euclidean lattices; Sphere packing; Minkowski- Hlawka bound; Linear codes; Parallelohedra; Chromatic number

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Moustrou, P. (2017). Geometric distance graphs, lattices and polytopes : Graphes métriques géométriques, réseaux et polytopes. (Doctoral Dissertation). Bordeaux. Retrieved from http://www.theses.fr/2017BORD0802

Chicago Manual of Style (16th Edition):

Moustrou, Philippe. “Geometric distance graphs, lattices and polytopes : Graphes métriques géométriques, réseaux et polytopes.” 2017. Doctoral Dissertation, Bordeaux. Accessed August 04, 2020. http://www.theses.fr/2017BORD0802.

MLA Handbook (7th Edition):

Moustrou, Philippe. “Geometric distance graphs, lattices and polytopes : Graphes métriques géométriques, réseaux et polytopes.” 2017. Web. 04 Aug 2020.

Vancouver:

Moustrou P. Geometric distance graphs, lattices and polytopes : Graphes métriques géométriques, réseaux et polytopes. [Internet] [Doctoral dissertation]. Bordeaux; 2017. [cited 2020 Aug 04]. Available from: http://www.theses.fr/2017BORD0802.

Council of Science Editors:

Moustrou P. Geometric distance graphs, lattices and polytopes : Graphes métriques géométriques, réseaux et polytopes. [Doctoral Dissertation]. Bordeaux; 2017. Available from: http://www.theses.fr/2017BORD0802

.