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:(Perfect Graphs). Showing records 1 – 20 of 20 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


University of Louisville

1. Brauch, Timothy M. Applications of the Combinatorial Nullstellensatz on bipartite graphs.

Degree: PhD, 2009, University of Louisville

 The Combinatorial Nullstellensatz can be used to solve certain problems in combinatorics. However, one of the major complications in using the Combinatorial Nullstellensatz is ensuring… (more)

Subjects/Keywords: Combinatorial Nullstellensatz; Bipartite graphs; Perfect matchings

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Brauch, T. M. (2009). Applications of the Combinatorial Nullstellensatz on bipartite graphs. (Doctoral Dissertation). University of Louisville. Retrieved from 10.18297/etd/144 ; https://ir.library.louisville.edu/etd/144

Chicago Manual of Style (16th Edition):

Brauch, Timothy M. “Applications of the Combinatorial Nullstellensatz on bipartite graphs.” 2009. Doctoral Dissertation, University of Louisville. Accessed August 04, 2020. 10.18297/etd/144 ; https://ir.library.louisville.edu/etd/144.

MLA Handbook (7th Edition):

Brauch, Timothy M. “Applications of the Combinatorial Nullstellensatz on bipartite graphs.” 2009. Web. 04 Aug 2020.

Vancouver:

Brauch TM. Applications of the Combinatorial Nullstellensatz on bipartite graphs. [Internet] [Doctoral dissertation]. University of Louisville; 2009. [cited 2020 Aug 04]. Available from: 10.18297/etd/144 ; https://ir.library.louisville.edu/etd/144.

Council of Science Editors:

Brauch TM. Applications of the Combinatorial Nullstellensatz on bipartite graphs. [Doctoral Dissertation]. University of Louisville; 2009. Available from: 10.18297/etd/144 ; https://ir.library.louisville.edu/etd/144


Wesleyan University

2. Vigliotta, Sarah Elizabeth. Fractional Chromatic Numbers of Incidence Graphs.

Degree: Mathematics and Computer Science, 2017, Wesleyan University

  In 1993, Brualdi and Massey defined the incidence graph of G, Inc(G), to be the graph whose vertices are the set of incidences -… (more)

Subjects/Keywords: Incidence Graphs; Fractional Chromatic Number; Perfect Graphs; Graph Homomorphisms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Vigliotta, S. E. (2017). Fractional Chromatic Numbers of Incidence Graphs. (Doctoral Dissertation). Wesleyan University. Retrieved from https://wesscholar.wesleyan.edu/etd_diss/73

Chicago Manual of Style (16th Edition):

Vigliotta, Sarah Elizabeth. “Fractional Chromatic Numbers of Incidence Graphs.” 2017. Doctoral Dissertation, Wesleyan University. Accessed August 04, 2020. https://wesscholar.wesleyan.edu/etd_diss/73.

MLA Handbook (7th Edition):

Vigliotta, Sarah Elizabeth. “Fractional Chromatic Numbers of Incidence Graphs.” 2017. Web. 04 Aug 2020.

Vancouver:

Vigliotta SE. Fractional Chromatic Numbers of Incidence Graphs. [Internet] [Doctoral dissertation]. Wesleyan University; 2017. [cited 2020 Aug 04]. Available from: https://wesscholar.wesleyan.edu/etd_diss/73.

Council of Science Editors:

Vigliotta SE. Fractional Chromatic Numbers of Incidence Graphs. [Doctoral Dissertation]. Wesleyan University; 2017. Available from: https://wesscholar.wesleyan.edu/etd_diss/73


Universiteit Utrecht

3. Hu, H. On the Extension Complexity of Stable Set Polytopes for Perfect Graphs.

Degree: 2015, Universiteit Utrecht

 In linear programming one can formulate many combinatorial optimization problems as optimizing a linear function over a feasible region that is a polytope. A polytope… (more)

Subjects/Keywords: linear programming; extension complexity; communication theory; stable set polytope; graph operations; perfect graphs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hu, H. (2015). On the Extension Complexity of Stable Set Polytopes for Perfect Graphs. (Masters Thesis). Universiteit Utrecht. Retrieved from http://dspace.library.uu.nl:8080/handle/1874/316002

Chicago Manual of Style (16th Edition):

Hu, H. “On the Extension Complexity of Stable Set Polytopes for Perfect Graphs.” 2015. Masters Thesis, Universiteit Utrecht. Accessed August 04, 2020. http://dspace.library.uu.nl:8080/handle/1874/316002.

MLA Handbook (7th Edition):

Hu, H. “On the Extension Complexity of Stable Set Polytopes for Perfect Graphs.” 2015. Web. 04 Aug 2020.

Vancouver:

Hu H. On the Extension Complexity of Stable Set Polytopes for Perfect Graphs. [Internet] [Masters thesis]. Universiteit Utrecht; 2015. [cited 2020 Aug 04]. Available from: http://dspace.library.uu.nl:8080/handle/1874/316002.

Council of Science Editors:

Hu H. On the Extension Complexity of Stable Set Polytopes for Perfect Graphs. [Masters Thesis]. Universiteit Utrecht; 2015. Available from: http://dspace.library.uu.nl:8080/handle/1874/316002


University of Colorado

4. Sidrow, Evan. Network Structure Sampling in Bayesian Networks via Perfect Sampling from Linear Extensions.

Degree: MS, Applied Mathematics, 2018, University of Colorado

  Bayesian networks are widely considered as powerful tools for modeling risk assessment, uncertainty, and decision making. They have been extensively employed to develop decision… (more)

Subjects/Keywords: Bayesian Networks; Partially Ordered Sets; Perfect Simulation; Directed Acyclic Graphs; Applied Statistics; Probability

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Sidrow, E. (2018). Network Structure Sampling in Bayesian Networks via Perfect Sampling from Linear Extensions. (Masters Thesis). University of Colorado. Retrieved from https://scholar.colorado.edu/appm_gradetds/98

Chicago Manual of Style (16th Edition):

Sidrow, Evan. “Network Structure Sampling in Bayesian Networks via Perfect Sampling from Linear Extensions.” 2018. Masters Thesis, University of Colorado. Accessed August 04, 2020. https://scholar.colorado.edu/appm_gradetds/98.

MLA Handbook (7th Edition):

Sidrow, Evan. “Network Structure Sampling in Bayesian Networks via Perfect Sampling from Linear Extensions.” 2018. Web. 04 Aug 2020.

Vancouver:

Sidrow E. Network Structure Sampling in Bayesian Networks via Perfect Sampling from Linear Extensions. [Internet] [Masters thesis]. University of Colorado; 2018. [cited 2020 Aug 04]. Available from: https://scholar.colorado.edu/appm_gradetds/98.

Council of Science Editors:

Sidrow E. Network Structure Sampling in Bayesian Networks via Perfect Sampling from Linear Extensions. [Masters Thesis]. University of Colorado; 2018. Available from: https://scholar.colorado.edu/appm_gradetds/98


Simon Fraser University

5. Yu, Qinglin. Factors and factor extensions.

Degree: 1991, Simon Fraser University

Subjects/Keywords: Perfect graphs.; Graph theory.; Factors (Algebra)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Yu, Q. (1991). Factors and factor extensions. (Thesis). Simon Fraser University. Retrieved from http://summit.sfu.ca/item/4686

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

Yu, Qinglin. “Factors and factor extensions.” 1991. Thesis, Simon Fraser University. Accessed August 04, 2020. http://summit.sfu.ca/item/4686.

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

MLA Handbook (7th Edition):

Yu, Qinglin. “Factors and factor extensions.” 1991. Web. 04 Aug 2020.

Vancouver:

Yu Q. Factors and factor extensions. [Internet] [Thesis]. Simon Fraser University; 1991. [cited 2020 Aug 04]. Available from: http://summit.sfu.ca/item/4686.

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

Council of Science Editors:

Yu Q. Factors and factor extensions. [Thesis]. Simon Fraser University; 1991. Available from: http://summit.sfu.ca/item/4686

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


Colorado State University

6. Manchanda, Saksham. On approximating transitivity and tractability of graphs.

Degree: MS(M.S.), Computer Science, 2016, Colorado State University

 In the general case, in a simple, undirected graph, the problems of finding the largest clique, minimum colouring, maximum independent set and minimum vertex cover… (more)

Subjects/Keywords: beta measure; NP complete; perfect graphs; graph theory; approximation algorithms; parametrized algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Manchanda, S. (2016). On approximating transitivity and tractability of graphs. (Masters Thesis). Colorado State University. Retrieved from http://hdl.handle.net/10217/176622

Chicago Manual of Style (16th Edition):

Manchanda, Saksham. “On approximating transitivity and tractability of graphs.” 2016. Masters Thesis, Colorado State University. Accessed August 04, 2020. http://hdl.handle.net/10217/176622.

MLA Handbook (7th Edition):

Manchanda, Saksham. “On approximating transitivity and tractability of graphs.” 2016. Web. 04 Aug 2020.

Vancouver:

Manchanda S. On approximating transitivity and tractability of graphs. [Internet] [Masters thesis]. Colorado State University; 2016. [cited 2020 Aug 04]. Available from: http://hdl.handle.net/10217/176622.

Council of Science Editors:

Manchanda S. On approximating transitivity and tractability of graphs. [Masters Thesis]. Colorado State University; 2016. Available from: http://hdl.handle.net/10217/176622

7. Trunck, Théophile. Trigraphes de Berge apprivoisés : Tame Berge trigraphes.

Degree: Docteur es, Informatique, 2014, Lyon, École normale supérieure

L'objectif de cette thèse est de réussir à utiliser des décompositions de graphes afin de résoudre des problèmes algorithmiques sur les graphes. Notre objet d'étude… (more)

Subjects/Keywords: Graphes parfaits; 2-joint; Clique-stable séparation; Décompositions extrêmes; Perfect graphs; 2-join; Clique-stable separator; Extreme decompositions

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Trunck, T. (2014). Trigraphes de Berge apprivoisés : Tame Berge trigraphes. (Doctoral Dissertation). Lyon, École normale supérieure. Retrieved from http://www.theses.fr/2014ENSL0929

Chicago Manual of Style (16th Edition):

Trunck, Théophile. “Trigraphes de Berge apprivoisés : Tame Berge trigraphes.” 2014. Doctoral Dissertation, Lyon, École normale supérieure. Accessed August 04, 2020. http://www.theses.fr/2014ENSL0929.

MLA Handbook (7th Edition):

Trunck, Théophile. “Trigraphes de Berge apprivoisés : Tame Berge trigraphes.” 2014. Web. 04 Aug 2020.

Vancouver:

Trunck T. Trigraphes de Berge apprivoisés : Tame Berge trigraphes. [Internet] [Doctoral dissertation]. Lyon, École normale supérieure; 2014. [cited 2020 Aug 04]. Available from: http://www.theses.fr/2014ENSL0929.

Council of Science Editors:

Trunck T. Trigraphes de Berge apprivoisés : Tame Berge trigraphes. [Doctoral Dissertation]. Lyon, École normale supérieure; 2014. Available from: http://www.theses.fr/2014ENSL0929


Université de Bordeaux I

8. Valicov, Petru. Problèmes de placement, de coloration et d’identification : On packing, colouring and identification problems.

Degree: Docteur es, Informatique, 2012, Université de Bordeaux I

Dans cette thèse, nous nous intéressons à trois problèmes issus de l'informatique théorique, à savoir le placement de formes rectangulaires dans un conteneur (OPP), la… (more)

Subjects/Keywords: Problème de placement orthogonal; Graphes d’intervalles; MPQ-arbres; Coloration forte d’arêtes; Déchargement; Graphes planaires; Graphes parfaits; Graphes adjoints; Codes identifiants; Complexité; Orthogonal packing problem; Interval graphs; MPQ-trees; Strong edge-colouring; Discharging; Planar graphs; Perfect graphs; Line graphs; Identifying codes; Complexity

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Valicov, P. (2012). Problèmes de placement, de coloration et d’identification : On packing, colouring and identification problems. (Doctoral Dissertation). Université de Bordeaux I. Retrieved from http://www.theses.fr/2012BOR14549

Chicago Manual of Style (16th Edition):

Valicov, Petru. “Problèmes de placement, de coloration et d’identification : On packing, colouring and identification problems.” 2012. Doctoral Dissertation, Université de Bordeaux I. Accessed August 04, 2020. http://www.theses.fr/2012BOR14549.

MLA Handbook (7th Edition):

Valicov, Petru. “Problèmes de placement, de coloration et d’identification : On packing, colouring and identification problems.” 2012. Web. 04 Aug 2020.

Vancouver:

Valicov P. Problèmes de placement, de coloration et d’identification : On packing, colouring and identification problems. [Internet] [Doctoral dissertation]. Université de Bordeaux I; 2012. [cited 2020 Aug 04]. Available from: http://www.theses.fr/2012BOR14549.

Council of Science Editors:

Valicov P. Problèmes de placement, de coloration et d’identification : On packing, colouring and identification problems. [Doctoral Dissertation]. Université de Bordeaux I; 2012. Available from: http://www.theses.fr/2012BOR14549

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

…additivity . . . . . . . . . . . . . . . . . . . . . . . . . 35 3.9 Perfect Graphs and Graph… …49 5.2 Symmetric Perfect Graphs . . . . . . . . . . . . . . . . . . . . . . . . . . . 51… …the the graph entropy and perfect graphs and fractional chromatic number of a graph. Chapter… …Entropy of Some Special Graphs . . . . . . . . . . . . . . . . . . . . . . . . 23 3.6 Graph… …Kneser Graphs . . . . . . . . . . . . . . 45 4.6 Further Results… 

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

10. Črešnjevec, Nina. Neodvisna dominacija na grafih.

Degree: 2018, Univerza v Mariboru

V magistrskem delu obravnavamo različne tipe dominacij in sicer dominantno število, neodvisnostno število, neodvisno dominantno število in zgornje dominantno število. Neodvisno dominantno število je raziskano… (more)

Subjects/Keywords: dominantno število; neodvisno dominantno število; neodvisnostno število; dominantno popolni grafi; dobro pokriti grafi; grafovski produkti; domination number; independent domination number; independence number; domination perfect graphs; well-covered graphs; product graphs; info:eu-repo/classification/udc/519.17(043.2)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Črešnjevec, N. (2018). Neodvisna dominacija na grafih. (Masters Thesis). Univerza v Mariboru. Retrieved from https://dk.um.si/IzpisGradiva.php?id=68833 ; https://dk.um.si/Dokument.php?id=119900&dn= ; https://plus.si.cobiss.net/opac7/bib/23904008?lang=sl

Chicago Manual of Style (16th Edition):

Črešnjevec, Nina. “Neodvisna dominacija na grafih.” 2018. Masters Thesis, Univerza v Mariboru. Accessed August 04, 2020. https://dk.um.si/IzpisGradiva.php?id=68833 ; https://dk.um.si/Dokument.php?id=119900&dn= ; https://plus.si.cobiss.net/opac7/bib/23904008?lang=sl.

MLA Handbook (7th Edition):

Črešnjevec, Nina. “Neodvisna dominacija na grafih.” 2018. Web. 04 Aug 2020.

Vancouver:

Črešnjevec N. Neodvisna dominacija na grafih. [Internet] [Masters thesis]. Univerza v Mariboru; 2018. [cited 2020 Aug 04]. Available from: https://dk.um.si/IzpisGradiva.php?id=68833 ; https://dk.um.si/Dokument.php?id=119900&dn= ; https://plus.si.cobiss.net/opac7/bib/23904008?lang=sl.

Council of Science Editors:

Črešnjevec N. Neodvisna dominacija na grafih. [Masters Thesis]. Univerza v Mariboru; 2018. Available from: https://dk.um.si/IzpisGradiva.php?id=68833 ; https://dk.um.si/Dokument.php?id=119900&dn= ; https://plus.si.cobiss.net/opac7/bib/23904008?lang=sl

11. Parshina, Olga. Structures périodiques en mots morphiques et en colorations de graphes circulants infinis : ПЕРИОДИЧЕСКИЕ СТРУКТУРЫ В МОРФИЧЕСКИХ СЛОВАХ И РАСКРАСКАХ БЕСКОНЕЧНЫХ ЦИРКУЛЯНТНЫХ ГРАФОВ.

Degree: Docteur es, Mathématiques, 2019, Lyon; Sobolev Institute of Mathematics

Cette thèse est composée de deux parties : l’une traite des propriétés combinatoires de mots infinis et l’autre des problèmes de colorations des graphes.La première… (more)

Subjects/Keywords: Mots morphiques; Graphes circulants; Coloris parfaits; Partitions équitables; Séquences automatiques; Espaces linéaires transitifs; Morphic words; Circulant graphs; Perfect colorings; Equitable partitions; Automatic sequences; Transitive linear spaces; 510

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Parshina, O. (2019). Structures périodiques en mots morphiques et en colorations de graphes circulants infinis : ПЕРИОДИЧЕСКИЕ СТРУКТУРЫ В МОРФИЧЕСКИХ СЛОВАХ И РАСКРАСКАХ БЕСКОНЕЧНЫХ ЦИРКУЛЯНТНЫХ ГРАФОВ. (Doctoral Dissertation). Lyon; Sobolev Institute of Mathematics. Retrieved from http://www.theses.fr/2019LYSE1071

Chicago Manual of Style (16th Edition):

Parshina, Olga. “Structures périodiques en mots morphiques et en colorations de graphes circulants infinis : ПЕРИОДИЧЕСКИЕ СТРУКТУРЫ В МОРФИЧЕСКИХ СЛОВАХ И РАСКРАСКАХ БЕСКОНЕЧНЫХ ЦИРКУЛЯНТНЫХ ГРАФОВ.” 2019. Doctoral Dissertation, Lyon; Sobolev Institute of Mathematics. Accessed August 04, 2020. http://www.theses.fr/2019LYSE1071.

MLA Handbook (7th Edition):

Parshina, Olga. “Structures périodiques en mots morphiques et en colorations de graphes circulants infinis : ПЕРИОДИЧЕСКИЕ СТРУКТУРЫ В МОРФИЧЕСКИХ СЛОВАХ И РАСКРАСКАХ БЕСКОНЕЧНЫХ ЦИРКУЛЯНТНЫХ ГРАФОВ.” 2019. Web. 04 Aug 2020.

Vancouver:

Parshina O. Structures périodiques en mots morphiques et en colorations de graphes circulants infinis : ПЕРИОДИЧЕСКИЕ СТРУКТУРЫ В МОРФИЧЕСКИХ СЛОВАХ И РАСКРАСКАХ БЕСКОНЕЧНЫХ ЦИРКУЛЯНТНЫХ ГРАФОВ. [Internet] [Doctoral dissertation]. Lyon; Sobolev Institute of Mathematics; 2019. [cited 2020 Aug 04]. Available from: http://www.theses.fr/2019LYSE1071.

Council of Science Editors:

Parshina O. Structures périodiques en mots morphiques et en colorations de graphes circulants infinis : ПЕРИОДИЧЕСКИЕ СТРУКТУРЫ В МОРФИЧЕСКИХ СЛОВАХ И РАСКРАСКАХ БЕСКОНЕЧНЫХ ЦИРКУЛЯНТНЫХ ГРАФОВ. [Doctoral Dissertation]. Lyon; Sobolev Institute of Mathematics; 2019. Available from: http://www.theses.fr/2019LYSE1071

12. Ιωαννίδου, Κυριακή. Χαρακτηρισμός νέων κλάσεων τέλειων γραφημάτων και αγλόριθμοι χρωματισμού και μέγιστων διαδρομών.

Degree: 2009, University of Ioannina; Πανεπιστήμιο Ιωαννίνων

 In this work we provide characterizations of two new classes of perfect graphs, namely colinear and linear graphs. Moreover, we present polynomial-time algorithms or NP-completeness… (more)

Subjects/Keywords: Colinear και linear γραφήματα; Colinear χρωματισμός; Χρωματισμός, Πρόβλημα αρμονικού; Πρόβλημα μέγιστων διαδρομών; Πολυωνυμικός αλγόριθμος; NP - πλήρη προβλήματα; Γραφήματα, Τέλεια; Colinear and linear graphs; Colinear coloring; Harmonious coloring problem; Longest path problem; Polynomial algorithm; NP - completeness; Perfect graphs; Graph classes characterizations

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ιωαννίδου, . . (2009). Χαρακτηρισμός νέων κλάσεων τέλειων γραφημάτων και αγλόριθμοι χρωματισμού και μέγιστων διαδρομών. (Thesis). University of Ioannina; Πανεπιστήμιο Ιωαννίνων. Retrieved from http://hdl.handle.net/10442/hedi/18620

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

Ιωαννίδου, Κυριακή. “Χαρακτηρισμός νέων κλάσεων τέλειων γραφημάτων και αγλόριθμοι χρωματισμού και μέγιστων διαδρομών.” 2009. Thesis, University of Ioannina; Πανεπιστήμιο Ιωαννίνων. Accessed August 04, 2020. http://hdl.handle.net/10442/hedi/18620.

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

MLA Handbook (7th Edition):

Ιωαννίδου, Κυριακή. “Χαρακτηρισμός νέων κλάσεων τέλειων γραφημάτων και αγλόριθμοι χρωματισμού και μέγιστων διαδρομών.” 2009. Web. 04 Aug 2020.

Vancouver:

Ιωαννίδου . Χαρακτηρισμός νέων κλάσεων τέλειων γραφημάτων και αγλόριθμοι χρωματισμού και μέγιστων διαδρομών. [Internet] [Thesis]. University of Ioannina; Πανεπιστήμιο Ιωαννίνων; 2009. [cited 2020 Aug 04]. Available from: http://hdl.handle.net/10442/hedi/18620.

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

Council of Science Editors:

Ιωαννίδου . Χαρακτηρισμός νέων κλάσεων τέλειων γραφημάτων και αγλόριθμοι χρωματισμού και μέγιστων διαδρομών. [Thesis]. University of Ioannina; Πανεπιστήμιο Ιωαννίνων; 2009. Available from: http://hdl.handle.net/10442/hedi/18620

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

13. Ασδρέ, Αικατερίνη. Αλγόριθμοι και αποτελέσματα NP - πληρότητας για προβλήματα χρωματισμού και επικάλυψης με μονοπάτια σε τέλεια γραφήματα.

Degree: 2008, University of Ioannina; Πανεπιστήμιο Ιωαννίνων

Subjects/Keywords: Αλγόριθμοι; Χρωματισμός; Επικάλυψη με μονοπάτια; Πολυπλοκότητα; Τέλεια γραφήματα; Κλάσεις γραφημάτων; Algorithms; NP - completeness; Coloring; Path cover; Complexity; Perfect graphs; Graph classes

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ασδρέ, . . (2008). Αλγόριθμοι και αποτελέσματα NP - πληρότητας για προβλήματα χρωματισμού και επικάλυψης με μονοπάτια σε τέλεια γραφήματα. (Thesis). University of Ioannina; Πανεπιστήμιο Ιωαννίνων. Retrieved from http://hdl.handle.net/10442/hedi/17553

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

Ασδρέ, Αικατερίνη. “Αλγόριθμοι και αποτελέσματα NP - πληρότητας για προβλήματα χρωματισμού και επικάλυψης με μονοπάτια σε τέλεια γραφήματα.” 2008. Thesis, University of Ioannina; Πανεπιστήμιο Ιωαννίνων. Accessed August 04, 2020. http://hdl.handle.net/10442/hedi/17553.

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

MLA Handbook (7th Edition):

Ασδρέ, Αικατερίνη. “Αλγόριθμοι και αποτελέσματα NP - πληρότητας για προβλήματα χρωματισμού και επικάλυψης με μονοπάτια σε τέλεια γραφήματα.” 2008. Web. 04 Aug 2020.

Vancouver:

Ασδρέ . Αλγόριθμοι και αποτελέσματα NP - πληρότητας για προβλήματα χρωματισμού και επικάλυψης με μονοπάτια σε τέλεια γραφήματα. [Internet] [Thesis]. University of Ioannina; Πανεπιστήμιο Ιωαννίνων; 2008. [cited 2020 Aug 04]. Available from: http://hdl.handle.net/10442/hedi/17553.

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

Council of Science Editors:

Ασδρέ . Αλγόριθμοι και αποτελέσματα NP - πληρότητας για προβλήματα χρωματισμού και επικάλυψης με μονοπάτια σε τέλεια γραφήματα. [Thesis]. University of Ioannina; Πανεπιστήμιο Ιωαννίνων; 2008. Available from: http://hdl.handle.net/10442/hedi/17553

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


Freie Universität Berlin

14. Frick, Stefanie. Stetige und höherdimensionale Ramsey-Theorie.

Degree: 2009, Freie Universität Berlin

 Der Gegenstand der vorliegenden Arbeit sind die unendliche Kombinatorik und die Ramsey-Theorie, wobei unter anderem einige Konsistenzresultate mit Hilfe von Forcing erzielt werden. Die Arbeit… (more)

Subjects/Keywords: Forcing; set theory; sacks forcing; infinite combinatorics; perfect sets; induced graphs; 500 Naturwissenschaften und Mathematik::510 Mathematik

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Frick, S. (2009). Stetige und höherdimensionale Ramsey-Theorie. (Thesis). Freie Universität Berlin. Retrieved from https://refubium.fu-berlin.de/handle/fub188/13605

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

Frick, Stefanie. “Stetige und höherdimensionale Ramsey-Theorie.” 2009. Thesis, Freie Universität Berlin. Accessed August 04, 2020. https://refubium.fu-berlin.de/handle/fub188/13605.

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

MLA Handbook (7th Edition):

Frick, Stefanie. “Stetige und höherdimensionale Ramsey-Theorie.” 2009. Web. 04 Aug 2020.

Vancouver:

Frick S. Stetige und höherdimensionale Ramsey-Theorie. [Internet] [Thesis]. Freie Universität Berlin; 2009. [cited 2020 Aug 04]. Available from: https://refubium.fu-berlin.de/handle/fub188/13605.

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

Council of Science Editors:

Frick S. Stetige und höherdimensionale Ramsey-Theorie. [Thesis]. Freie Universität Berlin; 2009. Available from: https://refubium.fu-berlin.de/handle/fub188/13605

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

15. Petr, Ciril. Kombinatorika posplošenih Hanojskih stolpov.

Degree: 2015, Univerza v Mariboru

Vpeljemo popoln opis stanja posplošenih Hanojskih stolpov in delni opis, s katerim opišemo le razmestitev vrhnjih ploščic. Definiramo preslikavo iz popolnega v delni opis, ugotavljamo… (more)

Subjects/Keywords: matematika; računalništvo; kombinatorika; Hanojski stolpi; algoritem; najkrajša pot; grafi Sierpińskega; 1-popolna koda;

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Petr, C. (2015). Kombinatorika posplošenih Hanojskih stolpov. (Doctoral Dissertation). Univerza v Mariboru. Retrieved from https://dk.um.si/IzpisGradiva.php?id=52098 ; https://dk.um.si/Dokument.php?id=76658&dn= ; https://plus.si.cobiss.net/opac7/bib/13020761?lang=sl

Chicago Manual of Style (16th Edition):

Petr, Ciril. “Kombinatorika posplošenih Hanojskih stolpov.” 2015. Doctoral Dissertation, Univerza v Mariboru. Accessed August 04, 2020. https://dk.um.si/IzpisGradiva.php?id=52098 ; https://dk.um.si/Dokument.php?id=76658&dn= ; https://plus.si.cobiss.net/opac7/bib/13020761?lang=sl.

MLA Handbook (7th Edition):

Petr, Ciril. “Kombinatorika posplošenih Hanojskih stolpov.” 2015. Web. 04 Aug 2020.

Vancouver:

Petr C. Kombinatorika posplošenih Hanojskih stolpov. [Internet] [Doctoral dissertation]. Univerza v Mariboru; 2015. [cited 2020 Aug 04]. Available from: https://dk.um.si/IzpisGradiva.php?id=52098 ; https://dk.um.si/Dokument.php?id=76658&dn= ; https://plus.si.cobiss.net/opac7/bib/13020761?lang=sl.

Council of Science Editors:

Petr C. Kombinatorika posplošenih Hanojskih stolpov. [Doctoral Dissertation]. Univerza v Mariboru; 2015. Available from: https://dk.um.si/IzpisGradiva.php?id=52098 ; https://dk.um.si/Dokument.php?id=76658&dn= ; https://plus.si.cobiss.net/opac7/bib/13020761?lang=sl

16. Benchetrit, Yohann. Propriétés géométriques du nombre chromatique : polyèdres, structures et algorithmes : Geometric properties of the chromatic number : polyhedra, structure and algorithms.

Degree: Docteur es, Mathématiques et informatique, 2015, Université Grenoble Alpes (ComUE)

Le calcul du nombre chromatique et la détermination d'une colo- ration optimale des sommets d'un graphe sont des problèmes NP- difficiles en général. Ils peuvent… (more)

Subjects/Keywords: Programmation entière; Graphes h-parfaits; Nombre chromatique; Propriété d'arrondi entier; Propriété de décomposition entière; Polytope des stables; Integer programming; H-perfect graphs; Chromatic number; Integer round-up property; Integer decomposition property; Stable set polytope; 004; 510

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Benchetrit, Y. (2015). Propriétés géométriques du nombre chromatique : polyèdres, structures et algorithmes : Geometric properties of the chromatic number : polyhedra, structure and algorithms. (Doctoral Dissertation). Université Grenoble Alpes (ComUE). Retrieved from http://www.theses.fr/2015GREAM049

Chicago Manual of Style (16th Edition):

Benchetrit, Yohann. “Propriétés géométriques du nombre chromatique : polyèdres, structures et algorithmes : Geometric properties of the chromatic number : polyhedra, structure and algorithms.” 2015. Doctoral Dissertation, Université Grenoble Alpes (ComUE). Accessed August 04, 2020. http://www.theses.fr/2015GREAM049.

MLA Handbook (7th Edition):

Benchetrit, Yohann. “Propriétés géométriques du nombre chromatique : polyèdres, structures et algorithmes : Geometric properties of the chromatic number : polyhedra, structure and algorithms.” 2015. Web. 04 Aug 2020.

Vancouver:

Benchetrit Y. Propriétés géométriques du nombre chromatique : polyèdres, structures et algorithmes : Geometric properties of the chromatic number : polyhedra, structure and algorithms. [Internet] [Doctoral dissertation]. Université Grenoble Alpes (ComUE); 2015. [cited 2020 Aug 04]. Available from: http://www.theses.fr/2015GREAM049.

Council of Science Editors:

Benchetrit Y. Propriétés géométriques du nombre chromatique : polyèdres, structures et algorithmes : Geometric properties of the chromatic number : polyhedra, structure and algorithms. [Doctoral Dissertation]. Université Grenoble Alpes (ComUE); 2015. Available from: http://www.theses.fr/2015GREAM049


ETH Zürich

17. Gaillard, Arlette D. Perfectness notions related to polarity.

Degree: 1991, ETH Zürich

Subjects/Keywords: POLYEDRISCHE KOMBINATORIK (OPERATIONS RESEARCH); PERFEKTE GRAPHEN (GRAPHENTHEORIE); POLYHEDRAL COMBINATORICS (OPERATIONS RESEARCH); PERFECT GRAPHS (GRAPH THEORY); info:eu-repo/classification/ddc/510; Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Gaillard, A. D. (1991). Perfectness notions related to polarity. (Doctoral Dissertation). ETH Zürich. Retrieved from http://hdl.handle.net/20.500.11850/140279

Chicago Manual of Style (16th Edition):

Gaillard, Arlette D. “Perfectness notions related to polarity.” 1991. Doctoral Dissertation, ETH Zürich. Accessed August 04, 2020. http://hdl.handle.net/20.500.11850/140279.

MLA Handbook (7th Edition):

Gaillard, Arlette D. “Perfectness notions related to polarity.” 1991. Web. 04 Aug 2020.

Vancouver:

Gaillard AD. Perfectness notions related to polarity. [Internet] [Doctoral dissertation]. ETH Zürich; 1991. [cited 2020 Aug 04]. Available from: http://hdl.handle.net/20.500.11850/140279.

Council of Science Editors:

Gaillard AD. Perfectness notions related to polarity. [Doctoral Dissertation]. ETH Zürich; 1991. Available from: http://hdl.handle.net/20.500.11850/140279


ETH Zürich

18. Raschle, Thomas. Generalized modular decompositions and the recognition of classes of perfectly orderable graphs.

Degree: 1999, ETH Zürich

Subjects/Keywords: PERFEKTE GRAPHEN (GRAPHENTHEORIE); GRAPHENALGORITHMEN + GEOMETRISCHE ALGORITHMEN (GRAPHENTHEORIE); PERFECT GRAPHS (GRAPH THEORY); GRAPH ALGORITHMS + GEOMETRIC ALGORITHMS (GRAPH THEORY); info:eu-repo/classification/ddc/510; Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Raschle, T. (1999). Generalized modular decompositions and the recognition of classes of perfectly orderable graphs. (Doctoral Dissertation). ETH Zürich. Retrieved from http://hdl.handle.net/20.500.11850/144297

Chicago Manual of Style (16th Edition):

Raschle, Thomas. “Generalized modular decompositions and the recognition of classes of perfectly orderable graphs.” 1999. Doctoral Dissertation, ETH Zürich. Accessed August 04, 2020. http://hdl.handle.net/20.500.11850/144297.

MLA Handbook (7th Edition):

Raschle, Thomas. “Generalized modular decompositions and the recognition of classes of perfectly orderable graphs.” 1999. Web. 04 Aug 2020.

Vancouver:

Raschle T. Generalized modular decompositions and the recognition of classes of perfectly orderable graphs. [Internet] [Doctoral dissertation]. ETH Zürich; 1999. [cited 2020 Aug 04]. Available from: http://hdl.handle.net/20.500.11850/144297.

Council of Science Editors:

Raschle T. Generalized modular decompositions and the recognition of classes of perfectly orderable graphs. [Doctoral Dissertation]. ETH Zürich; 1999. Available from: http://hdl.handle.net/20.500.11850/144297

19. Παπαδόπουλος, Χάρης. Αλγόριθμοι σε κατηγορίες τέλειων γραφημάτων.

Degree: 2005, University of Ioannina; Πανεπιστήμιο Ιωαννίνων

Subjects/Keywords: Πλήθος σκελετικών δέντρων; Αλγόριθμοι, Δυναμικός αναγνώρισης; Αλγόριθμοι, Βέλτιστος παράλληλος; Επικάλυψη με μονοπάτια; Κλάσεις τέλειων γραφημάτων; m - αποσύνθεση; Dynamic algorithm for recognition; Optimal parallel algorithm; Path cover; Classes of perfect graphs; Modular decomposition; Tree representation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Παπαδόπουλος, . . (2005). Αλγόριθμοι σε κατηγορίες τέλειων γραφημάτων. (Thesis). University of Ioannina; Πανεπιστήμιο Ιωαννίνων. Retrieved from http://hdl.handle.net/10442/hedi/21180

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

Παπαδόπουλος, Χάρης. “Αλγόριθμοι σε κατηγορίες τέλειων γραφημάτων.” 2005. Thesis, University of Ioannina; Πανεπιστήμιο Ιωαννίνων. Accessed August 04, 2020. http://hdl.handle.net/10442/hedi/21180.

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

MLA Handbook (7th Edition):

Παπαδόπουλος, Χάρης. “Αλγόριθμοι σε κατηγορίες τέλειων γραφημάτων.” 2005. Web. 04 Aug 2020.

Vancouver:

Παπαδόπουλος . Αλγόριθμοι σε κατηγορίες τέλειων γραφημάτων. [Internet] [Thesis]. University of Ioannina; Πανεπιστήμιο Ιωαννίνων; 2005. [cited 2020 Aug 04]. Available from: http://hdl.handle.net/10442/hedi/21180.

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

Council of Science Editors:

Παπαδόπουλος . Αλγόριθμοι σε κατηγορίες τέλειων γραφημάτων. [Thesis]. University of Ioannina; Πανεπιστήμιο Ιωαννίνων; 2005. Available from: http://hdl.handle.net/10442/hedi/21180

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


Aristotle University Of Thessaloniki (AUTH); Αριστοτέλειο Πανεπιστήμιο Θεσσαλονίκης (ΑΠΘ)

20. Καραγιάννης, Βασίλης. Πειραματικοί σχεδιασμοί και γραφήματα.

Degree: 2006, Aristotle University Of Thessaloniki (AUTH); Αριστοτέλειο Πανεπιστήμιο Θεσσαλονίκης (ΑΠΘ)

This dissertation presents a research on the construction of experimental designs, which is the first of the three objects of Statistics (according to R.A. Fisher,… (more)

Subjects/Keywords: Πειραματικοί σχεδιασμοί; D-βέλτιστοι σχεδιασμοί; Εκτιμητική τάξη ΙΙΙ; Κορεσμένοι σχεδιασμοί; Ορίζουσα; Διμερή γραφήματα; Τέλεια σύζευξη; Ανάλυση με αυτιά; Experimental designs; D-optimal designs; Resolution III; Saturated designs; Determinants; Bipartite graphs; Perfect matching; Ear decomposition

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Καραγιάννης, . . (2006). Πειραματικοί σχεδιασμοί και γραφήματα. (Thesis). Aristotle University Of Thessaloniki (AUTH); Αριστοτέλειο Πανεπιστήμιο Θεσσαλονίκης (ΑΠΘ). Retrieved from http://hdl.handle.net/10442/hedi/14505

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

Καραγιάννης, Βασίλης. “Πειραματικοί σχεδιασμοί και γραφήματα.” 2006. Thesis, Aristotle University Of Thessaloniki (AUTH); Αριστοτέλειο Πανεπιστήμιο Θεσσαλονίκης (ΑΠΘ). Accessed August 04, 2020. http://hdl.handle.net/10442/hedi/14505.

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

MLA Handbook (7th Edition):

Καραγιάννης, Βασίλης. “Πειραματικοί σχεδιασμοί και γραφήματα.” 2006. Web. 04 Aug 2020.

Vancouver:

Καραγιάννης . Πειραματικοί σχεδιασμοί και γραφήματα. [Internet] [Thesis]. Aristotle University Of Thessaloniki (AUTH); Αριστοτέλειο Πανεπιστήμιο Θεσσαλονίκης (ΑΠΘ); 2006. [cited 2020 Aug 04]. Available from: http://hdl.handle.net/10442/hedi/14505.

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

Council of Science Editors:

Καραγιάννης . Πειραματικοί σχεδιασμοί και γραφήματα. [Thesis]. Aristotle University Of Thessaloniki (AUTH); Αριστοτέλειο Πανεπιστήμιο Θεσσαλονίκης (ΑΠΘ); 2006. Available from: http://hdl.handle.net/10442/hedi/14505

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

.