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:(Chromatic number). Showing records 1 – 30 of 60 total matches.

[1] [2]

Search Limiters

Last 2 Years | English Only

Levels

Country

▼ Search Limiters


University of Waikato

1. Gilmore, Hamish Julian. Algebraic Properties of Chromatic Polynomials and Their Roots .

Degree: 2015, University of Waikato

 In this thesis we examine chromatic polynomials from the viewpoint of algebraic number theory. We relate algebraic properties of chromatic polynomials of graphs to structural… (more)

Subjects/Keywords: chromatic; polynomial; algebraic; number; theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Gilmore, H. J. (2015). Algebraic Properties of Chromatic Polynomials and Their Roots . (Masters Thesis). University of Waikato. Retrieved from http://hdl.handle.net/10289/9367

Chicago Manual of Style (16th Edition):

Gilmore, Hamish Julian. “Algebraic Properties of Chromatic Polynomials and Their Roots .” 2015. Masters Thesis, University of Waikato. Accessed August 04, 2020. http://hdl.handle.net/10289/9367.

MLA Handbook (7th Edition):

Gilmore, Hamish Julian. “Algebraic Properties of Chromatic Polynomials and Their Roots .” 2015. Web. 04 Aug 2020.

Vancouver:

Gilmore HJ. Algebraic Properties of Chromatic Polynomials and Their Roots . [Internet] [Masters thesis]. University of Waikato; 2015. [cited 2020 Aug 04]. Available from: http://hdl.handle.net/10289/9367.

Council of Science Editors:

Gilmore HJ. Algebraic Properties of Chromatic Polynomials and Their Roots . [Masters Thesis]. University of Waikato; 2015. Available from: http://hdl.handle.net/10289/9367


Virginia Commonwealth University

2. Hall, Coleman. On List-Coloring and the Sum List Chromatic Number of Graphs.

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

 This thesis explores several of the major results in list-coloring in an expository fashion. As a specialization of list coloring, the sum list chromatic number(more)

Subjects/Keywords: List Chromatic Number; Sum List Chromatic Number; Chromatic Number; Sum Choice Greedy; Physical Sciences and Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hall, C. (2011). On List-Coloring and the Sum List Chromatic Number of Graphs. (Thesis). Virginia Commonwealth University. Retrieved from https://doi.org/10.25772/YFSK-6S54 ; https://scholarscompass.vcu.edu/etd/2393

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

Hall, Coleman. “On List-Coloring and the Sum List Chromatic Number of Graphs.” 2011. Thesis, Virginia Commonwealth University. Accessed August 04, 2020. https://doi.org/10.25772/YFSK-6S54 ; https://scholarscompass.vcu.edu/etd/2393.

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

MLA Handbook (7th Edition):

Hall, Coleman. “On List-Coloring and the Sum List Chromatic Number of Graphs.” 2011. Web. 04 Aug 2020.

Vancouver:

Hall C. On List-Coloring and the Sum List Chromatic Number of Graphs. [Internet] [Thesis]. Virginia Commonwealth University; 2011. [cited 2020 Aug 04]. Available from: https://doi.org/10.25772/YFSK-6S54 ; https://scholarscompass.vcu.edu/etd/2393.

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

Council of Science Editors:

Hall C. On List-Coloring and the Sum List Chromatic Number of Graphs. [Thesis]. Virginia Commonwealth University; 2011. Available from: https://doi.org/10.25772/YFSK-6S54 ; https://scholarscompass.vcu.edu/etd/2393

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


University of Southern Mississippi

3. O'Rourke, Jonathan Lyons. Chromatic Thresholds of Regular Graphs with Small Cliques.

Degree: MS, Mathematics, 2014, University of Southern Mississippi

  The chromatic threshold of a class of graphs is the value θ such that any graph in this class with a minimum degree greater… (more)

Subjects/Keywords: chromatic number; chromatic threshold; graph theory; regular graphs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

O'Rourke, J. L. (2014). Chromatic Thresholds of Regular Graphs with Small Cliques. (Masters Thesis). University of Southern Mississippi. Retrieved from https://aquila.usm.edu/masters_theses/27

Chicago Manual of Style (16th Edition):

O'Rourke, Jonathan Lyons. “Chromatic Thresholds of Regular Graphs with Small Cliques.” 2014. Masters Thesis, University of Southern Mississippi. Accessed August 04, 2020. https://aquila.usm.edu/masters_theses/27.

MLA Handbook (7th Edition):

O'Rourke, Jonathan Lyons. “Chromatic Thresholds of Regular Graphs with Small Cliques.” 2014. Web. 04 Aug 2020.

Vancouver:

O'Rourke JL. Chromatic Thresholds of Regular Graphs with Small Cliques. [Internet] [Masters thesis]. University of Southern Mississippi; 2014. [cited 2020 Aug 04]. Available from: https://aquila.usm.edu/masters_theses/27.

Council of Science Editors:

O'Rourke JL. Chromatic Thresholds of Regular Graphs with Small Cliques. [Masters Thesis]. University of Southern Mississippi; 2014. Available from: https://aquila.usm.edu/masters_theses/27


NSYSU

4. Yang, Chung-Ying. Colouring, circular list colouring and adapted game colouring of graphs.

Degree: PhD, Applied Mathematics, 2010, NSYSU

 This thesis discusses colouring, circular list colouring and adapted game colouring of graphs. For colouring, this thesis obtains a sufficient condition for a planar graph… (more)

Subjects/Keywords: Cartesian product; chromatic number; adapted game chromatic number; game chromatic number; circular consecutive choosability; adapted; consecutive choosability; partial k-tree; circular chromatic number; planar; 3-colouring; circular choosability

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Yang, C. (2010). Colouring, circular list colouring and adapted game colouring of graphs. (Doctoral Dissertation). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0727110-000414

Chicago Manual of Style (16th Edition):

Yang, Chung-Ying. “Colouring, circular list colouring and adapted game colouring of graphs.” 2010. Doctoral Dissertation, NSYSU. Accessed August 04, 2020. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0727110-000414.

MLA Handbook (7th Edition):

Yang, Chung-Ying. “Colouring, circular list colouring and adapted game colouring of graphs.” 2010. Web. 04 Aug 2020.

Vancouver:

Yang C. Colouring, circular list colouring and adapted game colouring of graphs. [Internet] [Doctoral dissertation]. NSYSU; 2010. [cited 2020 Aug 04]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0727110-000414.

Council of Science Editors:

Yang C. Colouring, circular list colouring and adapted game colouring of graphs. [Doctoral Dissertation]. NSYSU; 2010. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0727110-000414


NSYSU

5. Wu, Yu-feng. The Oriented Colourings of Bipartite Graphs.

Degree: Master, Applied Mathematics, 2006, NSYSU

 Let S be a set of k distinct elements. An oriented k coloring of an oriented graph D is a mapping f:V(D)âS such that (i)… (more)

Subjects/Keywords: oriented chromatic number

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wu, Y. (2006). The Oriented Colourings of Bipartite Graphs. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0725106-232541

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

Wu, Yu-feng. “The Oriented Colourings of Bipartite Graphs.” 2006. Thesis, NSYSU. Accessed August 04, 2020. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0725106-232541.

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

MLA Handbook (7th Edition):

Wu, Yu-feng. “The Oriented Colourings of Bipartite Graphs.” 2006. Web. 04 Aug 2020.

Vancouver:

Wu Y. The Oriented Colourings of Bipartite Graphs. [Internet] [Thesis]. NSYSU; 2006. [cited 2020 Aug 04]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0725106-232541.

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

Council of Science Editors:

Wu Y. The Oriented Colourings of Bipartite Graphs. [Thesis]. NSYSU; 2006. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0725106-232541

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


University of KwaZulu-Natal

6. Mayala, Roger Mbonga. The eigen-chromatic ratio of classes of graphs : molecular stability, asymptotes and area.

Degree: 2017, University of KwaZulu-Natal

 This dissertation involves combining the two concepts of energy and the chromatic number of classes of graphs into a new ratio, the eigen-chromatic ratio of… (more)

Subjects/Keywords: Eigenvalues.; Graphs.; Chromatic number.; Ratios.; Asymptote.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Mayala, R. M. (2017). The eigen-chromatic ratio of classes of graphs : molecular stability, asymptotes and area. (Thesis). University of KwaZulu-Natal. Retrieved from http://hdl.handle.net/10413/15648

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

Mayala, Roger Mbonga. “The eigen-chromatic ratio of classes of graphs : molecular stability, asymptotes and area.” 2017. Thesis, University of KwaZulu-Natal. Accessed August 04, 2020. http://hdl.handle.net/10413/15648.

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

MLA Handbook (7th Edition):

Mayala, Roger Mbonga. “The eigen-chromatic ratio of classes of graphs : molecular stability, asymptotes and area.” 2017. Web. 04 Aug 2020.

Vancouver:

Mayala RM. The eigen-chromatic ratio of classes of graphs : molecular stability, asymptotes and area. [Internet] [Thesis]. University of KwaZulu-Natal; 2017. [cited 2020 Aug 04]. Available from: http://hdl.handle.net/10413/15648.

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

Council of Science Editors:

Mayala RM. The eigen-chromatic ratio of classes of graphs : molecular stability, asymptotes and area. [Thesis]. University of KwaZulu-Natal; 2017. Available from: http://hdl.handle.net/10413/15648

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


Montana Tech

7. Parsa, Esmaeil. ASPECTS OF UNIQUE D-COLORABILITY FOR DIGRAPHS.

Degree: PhD, 2019, Montana Tech

  We prove that for every digraph C and every choice of positive integers k and ℓ there exists a digraph D with girth at… (more)

Subjects/Keywords: Acyclic chromatic Number; Acyclic coloring; Acyclic homomorphisms; Digraph girth; High girth high chromatic number

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Parsa, E. (2019). ASPECTS OF UNIQUE D-COLORABILITY FOR DIGRAPHS. (Doctoral Dissertation). Montana Tech. Retrieved from https://scholarworks.umt.edu/etd/11366

Chicago Manual of Style (16th Edition):

Parsa, Esmaeil. “ASPECTS OF UNIQUE D-COLORABILITY FOR DIGRAPHS.” 2019. Doctoral Dissertation, Montana Tech. Accessed August 04, 2020. https://scholarworks.umt.edu/etd/11366.

MLA Handbook (7th Edition):

Parsa, Esmaeil. “ASPECTS OF UNIQUE D-COLORABILITY FOR DIGRAPHS.” 2019. Web. 04 Aug 2020.

Vancouver:

Parsa E. ASPECTS OF UNIQUE D-COLORABILITY FOR DIGRAPHS. [Internet] [Doctoral dissertation]. Montana Tech; 2019. [cited 2020 Aug 04]. Available from: https://scholarworks.umt.edu/etd/11366.

Council of Science Editors:

Parsa E. ASPECTS OF UNIQUE D-COLORABILITY FOR DIGRAPHS. [Doctoral Dissertation]. Montana Tech; 2019. Available from: https://scholarworks.umt.edu/etd/11366


NSYSU

8. Lin, Che-Yu. The circular chromatic numbers of line graphs and total graphs.

Degree: PhD, Applied Mathematics, 2014, NSYSU

 A circular r-colouring of a graph G is a mapping c : V (G) â [0, r) such that for any two adjacent vertices x… (more)

Subjects/Keywords: line graph; circular colouring; circular chromatic index; circular total chromatic number; total graph

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lin, C. (2014). The circular chromatic numbers of line graphs and total graphs. (Doctoral Dissertation). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0014114-151402

Chicago Manual of Style (16th Edition):

Lin, Che-Yu. “The circular chromatic numbers of line graphs and total graphs.” 2014. Doctoral Dissertation, NSYSU. Accessed August 04, 2020. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0014114-151402.

MLA Handbook (7th Edition):

Lin, Che-Yu. “The circular chromatic numbers of line graphs and total graphs.” 2014. Web. 04 Aug 2020.

Vancouver:

Lin C. The circular chromatic numbers of line graphs and total graphs. [Internet] [Doctoral dissertation]. NSYSU; 2014. [cited 2020 Aug 04]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0014114-151402.

Council of Science Editors:

Lin C. The circular chromatic numbers of line graphs and total graphs. [Doctoral Dissertation]. NSYSU; 2014. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0014114-151402


University of South Carolina

9. Peng, Xing. Fractional Chromatic Numbers and Spectra of Graphs.

Degree: PhD, Mathematics, 2012, University of South Carolina

  This dissertation mainly comes from my recent study of fractional chromatic numbers of graphs, spectra of edge-independent random graphs, Laplacian spectra of hypergraphs, and… (more)

Subjects/Keywords: Mathematics; Physical Sciences and Mathematics; chromatic number; edge-independent random graph; fractional chromatic number; Generalized Laplacian matrix; Laplacian matrix

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Peng, X. (2012). Fractional Chromatic Numbers and Spectra of Graphs. (Doctoral Dissertation). University of South Carolina. Retrieved from https://scholarcommons.sc.edu/etd/1610

Chicago Manual of Style (16th Edition):

Peng, Xing. “Fractional Chromatic Numbers and Spectra of Graphs.” 2012. Doctoral Dissertation, University of South Carolina. Accessed August 04, 2020. https://scholarcommons.sc.edu/etd/1610.

MLA Handbook (7th Edition):

Peng, Xing. “Fractional Chromatic Numbers and Spectra of Graphs.” 2012. Web. 04 Aug 2020.

Vancouver:

Peng X. Fractional Chromatic Numbers and Spectra of Graphs. [Internet] [Doctoral dissertation]. University of South Carolina; 2012. [cited 2020 Aug 04]. Available from: https://scholarcommons.sc.edu/etd/1610.

Council of Science Editors:

Peng X. Fractional Chromatic Numbers and Spectra of Graphs. [Doctoral Dissertation]. University of South Carolina; 2012. Available from: https://scholarcommons.sc.edu/etd/1610


NSYSU

10. Chang, Hung-yung. Game Colourings of Graphs.

Degree: PhD, Applied Mathematics, 2007, NSYSU

 A graph function f is a mapping which assigns each graph H a positive integer f(H) leq |V(H)| such that f(H)=f(H') if H and H'… (more)

Subjects/Keywords: f-game chromatic number; f-chromatic number

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chang, H. (2007). Game Colourings of Graphs. (Doctoral Dissertation). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0809107-161710

Chicago Manual of Style (16th Edition):

Chang, Hung-yung. “Game Colourings of Graphs.” 2007. Doctoral Dissertation, NSYSU. Accessed August 04, 2020. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0809107-161710.

MLA Handbook (7th Edition):

Chang, Hung-yung. “Game Colourings of Graphs.” 2007. Web. 04 Aug 2020.

Vancouver:

Chang H. Game Colourings of Graphs. [Internet] [Doctoral dissertation]. NSYSU; 2007. [cited 2020 Aug 04]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0809107-161710.

Council of Science Editors:

Chang H. Game Colourings of Graphs. [Doctoral Dissertation]. NSYSU; 2007. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0809107-161710


University of Oxford

11. Heckel, Annika. Colourings of random graphs.

Degree: PhD, 2016, University of Oxford

 We study graph parameters arising from different types of colourings of random graphs, defined broadly as an assignment of colours to either the vertices or… (more)

Subjects/Keywords: 511; Mathematics; Combinatorics; Graph colouring; Equitable chromatic number; Probabilistic combinatorics; Chromatic number; Random graphs; Random graph process; Rainbow connectivity

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Heckel, A. (2016). Colourings of random graphs. (Doctoral Dissertation). University of Oxford. Retrieved from http://ora.ox.ac.uk/objects/uuid:79e14d55-0589-4e17-bbb5-a216d81b8875 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.730062

Chicago Manual of Style (16th Edition):

Heckel, Annika. “Colourings of random graphs.” 2016. Doctoral Dissertation, University of Oxford. Accessed August 04, 2020. http://ora.ox.ac.uk/objects/uuid:79e14d55-0589-4e17-bbb5-a216d81b8875 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.730062.

MLA Handbook (7th Edition):

Heckel, Annika. “Colourings of random graphs.” 2016. Web. 04 Aug 2020.

Vancouver:

Heckel A. Colourings of random graphs. [Internet] [Doctoral dissertation]. University of Oxford; 2016. [cited 2020 Aug 04]. Available from: http://ora.ox.ac.uk/objects/uuid:79e14d55-0589-4e17-bbb5-a216d81b8875 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.730062.

Council of Science Editors:

Heckel A. Colourings of random graphs. [Doctoral Dissertation]. University of Oxford; 2016. Available from: http://ora.ox.ac.uk/objects/uuid:79e14d55-0589-4e17-bbb5-a216d81b8875 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.730062


NSYSU

12. Pan, Zhi-Shi. Construction of Graphs with Given Circular Chrotmatic Number or Circular Flow number.

Degree: PhD, Applied Mathematics, 2003, NSYSU

 This thesis constructs special graphs with given circular chromatic numbers or circular flow numbers. Suppose G=(V,E) is a graph and rgeq 2 is a real… (more)

Subjects/Keywords: circular chromatic number; circular flow number

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Pan, Z. (2003). Construction of Graphs with Given Circular Chrotmatic Number or Circular Flow number. (Doctoral Dissertation). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0627103-111233

Chicago Manual of Style (16th Edition):

Pan, Zhi-Shi. “Construction of Graphs with Given Circular Chrotmatic Number or Circular Flow number.” 2003. Doctoral Dissertation, NSYSU. Accessed August 04, 2020. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0627103-111233.

MLA Handbook (7th Edition):

Pan, Zhi-Shi. “Construction of Graphs with Given Circular Chrotmatic Number or Circular Flow number.” 2003. Web. 04 Aug 2020.

Vancouver:

Pan Z. Construction of Graphs with Given Circular Chrotmatic Number or Circular Flow number. [Internet] [Doctoral dissertation]. NSYSU; 2003. [cited 2020 Aug 04]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0627103-111233.

Council of Science Editors:

Pan Z. Construction of Graphs with Given Circular Chrotmatic Number or Circular Flow number. [Doctoral Dissertation]. NSYSU; 2003. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0627103-111233


University of Louisville

13. Leidner, Maxfield Edwin. A study of the total coloring of graphs.

Degree: PhD, 2012, University of Louisville

 The area of total coloring is a more recent and less studied area than vertex and edge coloring, but recently, some attention has been given… (more)

Subjects/Keywords: Total coloring; graph theory; total independence number; chromatic sum

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Leidner, M. E. (2012). A study of the total coloring of graphs. (Doctoral Dissertation). University of Louisville. Retrieved from 10.18297/etd/815 ; https://ir.library.louisville.edu/etd/815

Chicago Manual of Style (16th Edition):

Leidner, Maxfield Edwin. “A study of the total coloring of graphs.” 2012. Doctoral Dissertation, University of Louisville. Accessed August 04, 2020. 10.18297/etd/815 ; https://ir.library.louisville.edu/etd/815.

MLA Handbook (7th Edition):

Leidner, Maxfield Edwin. “A study of the total coloring of graphs.” 2012. Web. 04 Aug 2020.

Vancouver:

Leidner ME. A study of the total coloring of graphs. [Internet] [Doctoral dissertation]. University of Louisville; 2012. [cited 2020 Aug 04]. Available from: 10.18297/etd/815 ; https://ir.library.louisville.edu/etd/815.

Council of Science Editors:

Leidner ME. A study of the total coloring of graphs. [Doctoral Dissertation]. University of Louisville; 2012. Available from: 10.18297/etd/815 ; https://ir.library.louisville.edu/etd/815


NSYSU

14. Li, fu-qun. Chromatic number of integral distance graph.

Degree: Master, Applied Mathematics, 2001, NSYSU

 Abstract For a set D of positive integers, the integral distance graph G(Z, D) is the graph with vertex set Z and edge set {… (more)

Subjects/Keywords: integral distance graph; Chromatic number.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Li, f. (2001). Chromatic number of integral distance graph. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0213101-134241

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

Li, fu-qun. “Chromatic number of integral distance graph.” 2001. Thesis, NSYSU. Accessed August 04, 2020. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0213101-134241.

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

MLA Handbook (7th Edition):

Li, fu-qun. “Chromatic number of integral distance graph.” 2001. Web. 04 Aug 2020.

Vancouver:

Li f. Chromatic number of integral distance graph. [Internet] [Thesis]. NSYSU; 2001. [cited 2020 Aug 04]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0213101-134241.

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

Council of Science Editors:

Li f. Chromatic number of integral distance graph. [Thesis]. NSYSU; 2001. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0213101-134241

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


NSYSU

15. Wu, Jiao-Jiao. Game chromatic number of Halin graphs.

Degree: Master, Applied Mathematics, 2001, NSYSU

This thesis discusses the game chromatic number of Halin graphs. We shall prove that with a few exceptions, all Halin graphs have game chromatic number 4. Advisors/Committee Members: D. J. Guan (chair), Hong-Gwa Yeh (chair), Tsai-Lien Wong (chair), Xuding Zhu (committee member).

Subjects/Keywords: Game chromatic number; Halin graphs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wu, J. (2001). Game chromatic number of Halin graphs. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0627101-110358

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

Wu, Jiao-Jiao. “Game chromatic number of Halin graphs.” 2001. Thesis, NSYSU. Accessed August 04, 2020. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0627101-110358.

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

MLA Handbook (7th Edition):

Wu, Jiao-Jiao. “Game chromatic number of Halin graphs.” 2001. Web. 04 Aug 2020.

Vancouver:

Wu J. Game chromatic number of Halin graphs. [Internet] [Thesis]. NSYSU; 2001. [cited 2020 Aug 04]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0627101-110358.

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

Council of Science Editors:

Wu J. Game chromatic number of Halin graphs. [Thesis]. NSYSU; 2001. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0627101-110358

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


NSYSU

16. Liao, Shih-kai. Chip Firing and Fractional Chromatic Number of the Kneser Graph.

Degree: Master, Applied Mathematics, 2004, NSYSU

 In this thesis we focus on the investigation of the relation between the the chip-firing and fractional coloring. Since chif(G)=inf {n/k : G is homomorphic… (more)

Subjects/Keywords: fractional chromatic number; chip firing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Liao, S. (2004). Chip Firing and Fractional Chromatic Number of the Kneser Graph. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0629104-161112

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

Liao, Shih-kai. “Chip Firing and Fractional Chromatic Number of the Kneser Graph.” 2004. Thesis, NSYSU. Accessed August 04, 2020. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0629104-161112.

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

MLA Handbook (7th Edition):

Liao, Shih-kai. “Chip Firing and Fractional Chromatic Number of the Kneser Graph.” 2004. Web. 04 Aug 2020.

Vancouver:

Liao S. Chip Firing and Fractional Chromatic Number of the Kneser Graph. [Internet] [Thesis]. NSYSU; 2004. [cited 2020 Aug 04]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0629104-161112.

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

Council of Science Editors:

Liao S. Chip Firing and Fractional Chromatic Number of the Kneser Graph. [Thesis]. NSYSU; 2004. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0629104-161112

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


NSYSU

17. Hsieh, Chin-chih. Circular chromatic number of Kneser Graphs.

Degree: Master, Applied Mathematics, 2004, NSYSU

 This thesis studies the circular chromatic number of Kneser graphs. It was known that if m is greater than 2n2(n-1), then the Kneser graph KG(m,n)… (more)

Subjects/Keywords: circular chromatic number; Kneser graph

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hsieh, C. (2004). Circular chromatic number of Kneser Graphs. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0705104-163710

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

Hsieh, Chin-chih. “Circular chromatic number of Kneser Graphs.” 2004. Thesis, NSYSU. Accessed August 04, 2020. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0705104-163710.

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

MLA Handbook (7th Edition):

Hsieh, Chin-chih. “Circular chromatic number of Kneser Graphs.” 2004. Web. 04 Aug 2020.

Vancouver:

Hsieh C. Circular chromatic number of Kneser Graphs. [Internet] [Thesis]. NSYSU; 2004. [cited 2020 Aug 04]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0705104-163710.

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

Council of Science Editors:

Hsieh C. Circular chromatic number of Kneser Graphs. [Thesis]. NSYSU; 2004. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0705104-163710

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


Wesleyan University

18. Heenehan, Megan Elizabeth. Chromatic Number and Immersions of Complete Graphs.

Degree: Mathematics, 2013, Wesleyan University

  A classic question in graph theory is: Does a graph with chromatic number d "contain" a complete graph on d vertices in some way?… (more)

Subjects/Keywords: graph theory; immersion; complete graph; chromatic number; minimum degree

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Heenehan, M. E. (2013). Chromatic Number and Immersions of Complete Graphs. (Doctoral Dissertation). Wesleyan University. Retrieved from https://wesscholar.wesleyan.edu/etd_diss/22

Chicago Manual of Style (16th Edition):

Heenehan, Megan Elizabeth. “Chromatic Number and Immersions of Complete Graphs.” 2013. Doctoral Dissertation, Wesleyan University. Accessed August 04, 2020. https://wesscholar.wesleyan.edu/etd_diss/22.

MLA Handbook (7th Edition):

Heenehan, Megan Elizabeth. “Chromatic Number and Immersions of Complete Graphs.” 2013. Web. 04 Aug 2020.

Vancouver:

Heenehan ME. Chromatic Number and Immersions of Complete Graphs. [Internet] [Doctoral dissertation]. Wesleyan University; 2013. [cited 2020 Aug 04]. Available from: https://wesscholar.wesleyan.edu/etd_diss/22.

Council of Science Editors:

Heenehan ME. Chromatic Number and Immersions of Complete Graphs. [Doctoral Dissertation]. Wesleyan University; 2013. Available from: https://wesscholar.wesleyan.edu/etd_diss/22


Wesleyan University

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


University of Toronto

20. Soukup, Dániel Tamás. Colouring Problems of Erdős and Rado on Infinite Graphs.

Degree: PhD, 2015, University of Toronto

 The aim of this thesis is to provide solutions to two old problems on infinite graphs. First, we investigate vertex partitions of edge coloured complete… (more)

Subjects/Keywords: chromatic number; connected graph; decomposition; edge colouring; infinite graph; path; 0405

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Soukup, D. T. (2015). Colouring Problems of Erdős and Rado on Infinite Graphs. (Doctoral Dissertation). University of Toronto. Retrieved from http://hdl.handle.net/1807/71331

Chicago Manual of Style (16th Edition):

Soukup, Dániel Tamás. “Colouring Problems of Erdős and Rado on Infinite Graphs.” 2015. Doctoral Dissertation, University of Toronto. Accessed August 04, 2020. http://hdl.handle.net/1807/71331.

MLA Handbook (7th Edition):

Soukup, Dániel Tamás. “Colouring Problems of Erdős and Rado on Infinite Graphs.” 2015. Web. 04 Aug 2020.

Vancouver:

Soukup DT. Colouring Problems of Erdős and Rado on Infinite Graphs. [Internet] [Doctoral dissertation]. University of Toronto; 2015. [cited 2020 Aug 04]. Available from: http://hdl.handle.net/1807/71331.

Council of Science Editors:

Soukup DT. Colouring Problems of Erdős and Rado on Infinite Graphs. [Doctoral Dissertation]. University of Toronto; 2015. Available from: http://hdl.handle.net/1807/71331

21. Toole, Alex. Repetition-free vertex colorings of grid graphs .

Degree: 2014, California State University – San Marcos

 A repetition-free coloring of a graph is a coloring of its vertices such that there are no paths for which the color pattern on the… (more)

Subjects/Keywords: vertex coloring; repetition-free; Thue chromatic number; grid graph; algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Toole, A. (2014). Repetition-free vertex colorings of grid graphs . (Thesis). California State University – San Marcos. Retrieved from http://hdl.handle.net/10211.3/120343

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

Toole, Alex. “Repetition-free vertex colorings of grid graphs .” 2014. Thesis, California State University – San Marcos. Accessed August 04, 2020. http://hdl.handle.net/10211.3/120343.

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

MLA Handbook (7th Edition):

Toole, Alex. “Repetition-free vertex colorings of grid graphs .” 2014. Web. 04 Aug 2020.

Vancouver:

Toole A. Repetition-free vertex colorings of grid graphs . [Internet] [Thesis]. California State University – San Marcos; 2014. [cited 2020 Aug 04]. Available from: http://hdl.handle.net/10211.3/120343.

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

Council of Science Editors:

Toole A. Repetition-free vertex colorings of grid graphs . [Thesis]. California State University – San Marcos; 2014. Available from: http://hdl.handle.net/10211.3/120343

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


NSYSU

22. Wu, Jiaojiao. Graph marking game and graph colouring game.

Degree: PhD, Applied Mathematics, 2005, NSYSU

 This thesis discusses graph marking game and graph colouring game. Suppose G=(V, E) is a graph. A marking game on G is played by two… (more)

Subjects/Keywords: game chromatic number; game coloring number; relaxed game chromatic number

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wu, J. (2005). Graph marking game and graph colouring game. (Doctoral Dissertation). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0614105-172724

Chicago Manual of Style (16th Edition):

Wu, Jiaojiao. “Graph marking game and graph colouring game.” 2005. Doctoral Dissertation, NSYSU. Accessed August 04, 2020. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0614105-172724.

MLA Handbook (7th Edition):

Wu, Jiaojiao. “Graph marking game and graph colouring game.” 2005. Web. 04 Aug 2020.

Vancouver:

Wu J. Graph marking game and graph colouring game. [Internet] [Doctoral dissertation]. NSYSU; 2005. [cited 2020 Aug 04]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0614105-172724.

Council of Science Editors:

Wu J. Graph marking game and graph colouring game. [Doctoral Dissertation]. NSYSU; 2005. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0614105-172724


University of South Carolina

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

24. Cooper, Jeffrey R. Independent Sets in Sparse Hypergraphs.

Degree: 2014, University of Illinois – Chicago

 We study the independence number and chromatic number of hypergraphs which contain no copies of a fixed subgraph. Let H be a 3-uniform hypergraph with… (more)

Subjects/Keywords: hypergraphs; independent sets; chromatic number

…Evolution of the semi-random method The chromatic number of a hypergraph is the minimum number of… …has chromatic number O(∆1/(k−1) ). Given the success in bounding the… …chromatic number. For example, if K is a tree on e edges and G contains no copy of K, then χ(… …Thus the chromatic index of H is the minimum number of colors in a proper edge coloring of H… …Pippenger and Spencer’s result when the maximum codegree is 1. 1.2.2 Chromatic number Kahn’s… 

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

Cooper, J. R. (2014). Independent Sets in Sparse Hypergraphs. (Thesis). University of Illinois – Chicago. Retrieved from http://hdl.handle.net/10027/18782

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

Cooper, Jeffrey R. “Independent Sets in Sparse Hypergraphs.” 2014. Thesis, University of Illinois – Chicago. Accessed August 04, 2020. http://hdl.handle.net/10027/18782.

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

MLA Handbook (7th Edition):

Cooper, Jeffrey R. “Independent Sets in Sparse Hypergraphs.” 2014. Web. 04 Aug 2020.

Vancouver:

Cooper JR. Independent Sets in Sparse Hypergraphs. [Internet] [Thesis]. University of Illinois – Chicago; 2014. [cited 2020 Aug 04]. Available from: http://hdl.handle.net/10027/18782.

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

Council of Science Editors:

Cooper JR. Independent Sets in Sparse Hypergraphs. [Thesis]. University of Illinois – Chicago; 2014. Available from: http://hdl.handle.net/10027/18782

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


University of North Texas

25. Krohne, Edward. Continuous Combinatorics of a Lattice Graph in the Cantor Space.

Degree: 2016, University of North Texas

 We present a novel theorem of Borel Combinatorics that sheds light on the types of continuous functions that can be defined on the Cantor space.… (more)

Subjects/Keywords: descriptive set theory; combinatorics; graph theory; chromatic number; mathematics; Combinatorial analysis.; Graph theory.; Lattice theory.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Krohne, E. (2016). Continuous Combinatorics of a Lattice Graph in the Cantor Space. (Thesis). University of North Texas. Retrieved from https://digital.library.unt.edu/ark:/67531/metadc849680/

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

Krohne, Edward. “Continuous Combinatorics of a Lattice Graph in the Cantor Space.” 2016. Thesis, University of North Texas. Accessed August 04, 2020. https://digital.library.unt.edu/ark:/67531/metadc849680/.

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

MLA Handbook (7th Edition):

Krohne, Edward. “Continuous Combinatorics of a Lattice Graph in the Cantor Space.” 2016. Web. 04 Aug 2020.

Vancouver:

Krohne E. Continuous Combinatorics of a Lattice Graph in the Cantor Space. [Internet] [Thesis]. University of North Texas; 2016. [cited 2020 Aug 04]. Available from: https://digital.library.unt.edu/ark:/67531/metadc849680/.

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

Council of Science Editors:

Krohne E. Continuous Combinatorics of a Lattice Graph in the Cantor Space. [Thesis]. University of North Texas; 2016. Available from: https://digital.library.unt.edu/ark:/67531/metadc849680/

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

26. Ali, Parvez. Study of Chordal graphs;.

Degree: Applied Mathematics, 2008, Aligarh Muslim University

Abstract available newline newline

Bibliography p.132-144

Advisors/Committee Members: Anonymous, Merajuddin.

Subjects/Keywords: Chordal; Chromatic Number; Stability Number; Clique Covering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ali, P. (2008). Study of Chordal graphs;. (Thesis). Aligarh Muslim University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/53392

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

Ali, Parvez. “Study of Chordal graphs;.” 2008. Thesis, Aligarh Muslim University. Accessed August 04, 2020. http://shodhganga.inflibnet.ac.in/handle/10603/53392.

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

MLA Handbook (7th Edition):

Ali, Parvez. “Study of Chordal graphs;.” 2008. Web. 04 Aug 2020.

Vancouver:

Ali P. Study of Chordal graphs;. [Internet] [Thesis]. Aligarh Muslim University; 2008. [cited 2020 Aug 04]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/53392.

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

Council of Science Editors:

Ali P. Study of Chordal graphs;. [Thesis]. Aligarh Muslim University; 2008. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/53392

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


Université de Bordeaux I

27. Passuello, Alberto. Semidefinite programming in combinatorial optimization with applications to coding theory and geometry : Programmation semidéfinie positive dans l’optimisation combinatoire avec applications à la théorie des codes correcteurs et à la géométrie.

Degree: Docteur es, Mathématiques pures, 2013, Université de Bordeaux I

Une nouvelle borne supérieure sur le cardinal des codes de sous-espaces d'un espace vectoriel fini est établie grâce à la méthode de la programmation semidéfinie… (more)

Subjects/Keywords: Théorie des graphes; Nombre d'indépendance; Nombre chromatique; Sdp; Codes projectifs; Hiérarchies; Graph theory; Stable number; Chromatic number; Sdp; Projective codes; Hierarchies

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Passuello, A. (2013). Semidefinite programming in combinatorial optimization with applications to coding theory and geometry : Programmation semidéfinie positive dans l’optimisation combinatoire avec applications à la théorie des codes correcteurs et à la géométrie. (Doctoral Dissertation). Université de Bordeaux I. Retrieved from http://www.theses.fr/2013BOR15007

Chicago Manual of Style (16th Edition):

Passuello, Alberto. “Semidefinite programming in combinatorial optimization with applications to coding theory and geometry : Programmation semidéfinie positive dans l’optimisation combinatoire avec applications à la théorie des codes correcteurs et à la géométrie.” 2013. Doctoral Dissertation, Université de Bordeaux I. Accessed August 04, 2020. http://www.theses.fr/2013BOR15007.

MLA Handbook (7th Edition):

Passuello, Alberto. “Semidefinite programming in combinatorial optimization with applications to coding theory and geometry : Programmation semidéfinie positive dans l’optimisation combinatoire avec applications à la théorie des codes correcteurs et à la géométrie.” 2013. Web. 04 Aug 2020.

Vancouver:

Passuello A. Semidefinite programming in combinatorial optimization with applications to coding theory and geometry : Programmation semidéfinie positive dans l’optimisation combinatoire avec applications à la théorie des codes correcteurs et à la géométrie. [Internet] [Doctoral dissertation]. Université de Bordeaux I; 2013. [cited 2020 Aug 04]. Available from: http://www.theses.fr/2013BOR15007.

Council of Science Editors:

Passuello A. Semidefinite programming in combinatorial optimization with applications to coding theory and geometry : Programmation semidéfinie positive dans l’optimisation combinatoire avec applications à la théorie des codes correcteurs et à la géométrie. [Doctoral Dissertation]. Université de Bordeaux I; 2013. Available from: http://www.theses.fr/2013BOR15007

28. Kim, Ringi. On unavoidable graphs and tournaments .

Degree: PhD, 2016, Princeton University

 Ramsey's theorem asserts that every sufficiently large graph contains either a large complete graph or its complement as an induced subgraph. There are many variants… (more)

Subjects/Keywords: chromatic number; domination number; graph; tournament

…Wn or a prime chain of length n. 1.2 Tournaments with large chromatic number For a graph… …x7D;-free graph has chromatic number at most c, but it is easy to see that it is equivalent… …we say T is k-colorable. The chromatic number χ(T ) of T is the minimum k such… …tournament has chromatic number at most c. Here, we study finite heroic sets for tournaments… …tournament T , if T [N + (v)] has chromatic number at most k where N + (v… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kim, R. (2016). On unavoidable graphs and tournaments . (Doctoral Dissertation). Princeton University. Retrieved from http://arks.princeton.edu/ark:/88435/dsp014x51hm497

Chicago Manual of Style (16th Edition):

Kim, Ringi. “On unavoidable graphs and tournaments .” 2016. Doctoral Dissertation, Princeton University. Accessed August 04, 2020. http://arks.princeton.edu/ark:/88435/dsp014x51hm497.

MLA Handbook (7th Edition):

Kim, Ringi. “On unavoidable graphs and tournaments .” 2016. Web. 04 Aug 2020.

Vancouver:

Kim R. On unavoidable graphs and tournaments . [Internet] [Doctoral dissertation]. Princeton University; 2016. [cited 2020 Aug 04]. Available from: http://arks.princeton.edu/ark:/88435/dsp014x51hm497.

Council of Science Editors:

Kim R. On unavoidable graphs and tournaments . [Doctoral Dissertation]. Princeton University; 2016. Available from: http://arks.princeton.edu/ark:/88435/dsp014x51hm497

29. Palamourdas, Konstantinos. 1,2,3,...,2n+1, infinity!.

Degree: Mathematics, 2012, UCLA

 It is well known that the Borel chromatic number of a graph generated by a Borel function is omega or at most 3. In this… (more)

Subjects/Keywords: Mathematics; Borel; bound; chromatic number; coloring; graph

chromatic number. The concept of Borel chromatic numbers is parallel to that of the usual… …one (Borel) function has a Borel chromatic number which is ω or at most 3. In this… …for which G admits a k-coloring is called the chromatic number of G. We write this as X… …Borel chromatic number of G, denoted XB (G), to be the smallest n ∈ ω +1 s.t. G… …to produce a quadratic bound for the chromatic number of graphs generated by n Borel 9… 

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

Palamourdas, K. (2012). 1,2,3,...,2n+1, infinity!. (Thesis). UCLA. Retrieved from http://www.escholarship.org/uc/item/1075v66x

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

Palamourdas, Konstantinos. “1,2,3,...,2n+1, infinity!.” 2012. Thesis, UCLA. Accessed August 04, 2020. http://www.escholarship.org/uc/item/1075v66x.

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

MLA Handbook (7th Edition):

Palamourdas, Konstantinos. “1,2,3,...,2n+1, infinity!.” 2012. Web. 04 Aug 2020.

Vancouver:

Palamourdas K. 1,2,3,...,2n+1, infinity!. [Internet] [Thesis]. UCLA; 2012. [cited 2020 Aug 04]. Available from: http://www.escholarship.org/uc/item/1075v66x.

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

Council of Science Editors:

Palamourdas K. 1,2,3,...,2n+1, infinity!. [Thesis]. UCLA; 2012. Available from: http://www.escholarship.org/uc/item/1075v66x

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


Rochester Institute of Technology

30. Schornstein, Nancy M. Computing the chromatic number of t-(v,k,[lambda]) designs.

Degree: Computer Science (GCCIS), 1989, Rochester Institute of Technology

 Colouring t-designs has previously been shown to be an NP-complete problem; heuristics and a practical algorithm for this problem were developed for this thesis; the… (more)

Subjects/Keywords: Chromatic number; Map coloring problem; T-designs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Schornstein, N. M. (1989). Computing the chromatic number of t-(v,k,[lambda]) designs. (Thesis). Rochester Institute of Technology. Retrieved from https://scholarworks.rit.edu/theses/460

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

Schornstein, Nancy M. “Computing the chromatic number of t-(v,k,[lambda]) designs.” 1989. Thesis, Rochester Institute of Technology. Accessed August 04, 2020. https://scholarworks.rit.edu/theses/460.

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

MLA Handbook (7th Edition):

Schornstein, Nancy M. “Computing the chromatic number of t-(v,k,[lambda]) designs.” 1989. Web. 04 Aug 2020.

Vancouver:

Schornstein NM. Computing the chromatic number of t-(v,k,[lambda]) designs. [Internet] [Thesis]. Rochester Institute of Technology; 1989. [cited 2020 Aug 04]. Available from: https://scholarworks.rit.edu/theses/460.

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

Council of Science Editors:

Schornstein NM. Computing the chromatic number of t-(v,k,[lambda]) designs. [Thesis]. Rochester Institute of Technology; 1989. Available from: https://scholarworks.rit.edu/theses/460

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

[1] [2]

.