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:(graph colouring). Showing records 1 – 30 of 46 total matches.

[1] [2]

Search Limiters

Last 2 Years | English Only

Country

▼ Search Limiters


University of Waterloo

1. Kroeker, Matthew Eliot. Sparsity in Critical Graphs with Small Clique Number.

Degree: 2020, University of Waterloo

 In 1998, Reed conjectured that for every graph G, χ(G)  ≤  \lceil \frac{1}{2}(Δ(G)+1+ω(G)) \rceil, and proved that there exists ε > 0 such that χ(G)… (more)

Subjects/Keywords: graph theory; graph colouring

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kroeker, M. E. (2020). Sparsity in Critical Graphs with Small Clique Number. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/16178

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

Kroeker, Matthew Eliot. “Sparsity in Critical Graphs with Small Clique Number.” 2020. Thesis, University of Waterloo. Accessed October 23, 2020. http://hdl.handle.net/10012/16178.

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

MLA Handbook (7th Edition):

Kroeker, Matthew Eliot. “Sparsity in Critical Graphs with Small Clique Number.” 2020. Web. 23 Oct 2020.

Vancouver:

Kroeker ME. Sparsity in Critical Graphs with Small Clique Number. [Internet] [Thesis]. University of Waterloo; 2020. [cited 2020 Oct 23]. Available from: http://hdl.handle.net/10012/16178.

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

Council of Science Editors:

Kroeker ME. Sparsity in Critical Graphs with Small Clique Number. [Thesis]. University of Waterloo; 2020. Available from: http://hdl.handle.net/10012/16178

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


University of Waterloo

2. Sullivan, Matthew. Planar graphs without 3-cycles and with 4-cycles far apart are 3-choosable.

Degree: 2016, University of Waterloo

 A graph G is said to be L-colourable if for a given list assignment L = {L(v)|v ∈ V (G)} there is a proper colouring(more)

Subjects/Keywords: Graph Theory; Graph Colouring

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Sullivan, M. (2016). Planar graphs without 3-cycles and with 4-cycles far apart are 3-choosable. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/10859

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

Sullivan, Matthew. “Planar graphs without 3-cycles and with 4-cycles far apart are 3-choosable.” 2016. Thesis, University of Waterloo. Accessed October 23, 2020. http://hdl.handle.net/10012/10859.

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

MLA Handbook (7th Edition):

Sullivan, Matthew. “Planar graphs without 3-cycles and with 4-cycles far apart are 3-choosable.” 2016. Web. 23 Oct 2020.

Vancouver:

Sullivan M. Planar graphs without 3-cycles and with 4-cycles far apart are 3-choosable. [Internet] [Thesis]. University of Waterloo; 2016. [cited 2020 Oct 23]. Available from: http://hdl.handle.net/10012/10859.

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

Council of Science Editors:

Sullivan M. Planar graphs without 3-cycles and with 4-cycles far apart are 3-choosable. [Thesis]. University of Waterloo; 2016. Available from: http://hdl.handle.net/10012/10859

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


Princeton University

3. Edwards, Katherine. On edge colouring, fractionally colouring and partitioning graphs .

Degree: PhD, 2016, Princeton University

 We present an assortment of results in graph theory. First, Tutte conjectured that every two-edge-connected cubic graph with no Petersen graph minor is three-edge-colourable. This… (more)

Subjects/Keywords: edge colouring; fractional colouring; graph colouring; graph theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Edwards, K. (2016). On edge colouring, fractionally colouring and partitioning graphs . (Doctoral Dissertation). Princeton University. Retrieved from http://arks.princeton.edu/ark:/88435/dsp01qj72p9619

Chicago Manual of Style (16th Edition):

Edwards, Katherine. “On edge colouring, fractionally colouring and partitioning graphs .” 2016. Doctoral Dissertation, Princeton University. Accessed October 23, 2020. http://arks.princeton.edu/ark:/88435/dsp01qj72p9619.

MLA Handbook (7th Edition):

Edwards, Katherine. “On edge colouring, fractionally colouring and partitioning graphs .” 2016. Web. 23 Oct 2020.

Vancouver:

Edwards K. On edge colouring, fractionally colouring and partitioning graphs . [Internet] [Doctoral dissertation]. Princeton University; 2016. [cited 2020 Oct 23]. Available from: http://arks.princeton.edu/ark:/88435/dsp01qj72p9619.

Council of Science Editors:

Edwards K. On edge colouring, fractionally colouring and partitioning graphs . [Doctoral Dissertation]. Princeton University; 2016. Available from: http://arks.princeton.edu/ark:/88435/dsp01qj72p9619


University of New South Wales

4. Ayre, Peter. Hypergraphs: colourability, contiguity and rigidity.

Degree: Mathematics & Statistics, 2019, University of New South Wales

 Constraint satisfaction problems (CSPs) capture some of the most conceptually basic, yet difficult questions in mathematics. A CSP is defined by a set of variables… (more)

Subjects/Keywords: Graph; Colouring; Hypergraph; Combinatorics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ayre, P. (2019). Hypergraphs: colourability, contiguity and rigidity. (Doctoral Dissertation). University of New South Wales. Retrieved from http://handle.unsw.edu.au/1959.4/62993 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:59574/SOURCE02?view=true

Chicago Manual of Style (16th Edition):

Ayre, Peter. “Hypergraphs: colourability, contiguity and rigidity.” 2019. Doctoral Dissertation, University of New South Wales. Accessed October 23, 2020. http://handle.unsw.edu.au/1959.4/62993 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:59574/SOURCE02?view=true.

MLA Handbook (7th Edition):

Ayre, Peter. “Hypergraphs: colourability, contiguity and rigidity.” 2019. Web. 23 Oct 2020.

Vancouver:

Ayre P. Hypergraphs: colourability, contiguity and rigidity. [Internet] [Doctoral dissertation]. University of New South Wales; 2019. [cited 2020 Oct 23]. Available from: http://handle.unsw.edu.au/1959.4/62993 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:59574/SOURCE02?view=true.

Council of Science Editors:

Ayre P. Hypergraphs: colourability, contiguity and rigidity. [Doctoral Dissertation]. University of New South Wales; 2019. Available from: http://handle.unsw.edu.au/1959.4/62993 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:59574/SOURCE02?view=true


University of Waterloo

5. Redlin, Shayla. Acyclic Colouring of Graphs on Surfaces.

Degree: 2018, University of Waterloo

 An acyclic k-colouring of a graph G is a proper k-colouring of G with no bichromatic cycles. In 1979, Borodin proved that planar graphs are… (more)

Subjects/Keywords: graph theory; graph colouring; acyclic colouring; colouring graphs on surfaces; critical graphs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Redlin, S. (2018). Acyclic Colouring of Graphs on Surfaces. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/13732

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

Redlin, Shayla. “Acyclic Colouring of Graphs on Surfaces.” 2018. Thesis, University of Waterloo. Accessed October 23, 2020. http://hdl.handle.net/10012/13732.

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

MLA Handbook (7th Edition):

Redlin, Shayla. “Acyclic Colouring of Graphs on Surfaces.” 2018. Web. 23 Oct 2020.

Vancouver:

Redlin S. Acyclic Colouring of Graphs on Surfaces. [Internet] [Thesis]. University of Waterloo; 2018. [cited 2020 Oct 23]. Available from: http://hdl.handle.net/10012/13732.

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

Council of Science Editors:

Redlin S. Acyclic Colouring of Graphs on Surfaces. [Thesis]. University of Waterloo; 2018. Available from: http://hdl.handle.net/10012/13732

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


University of Guelph

6. Kielstra, Immanuel Thomas. Analysing the Effectiveness of Different Parameter Optimization Techniques for Complex Genetic Algorithmsd.

Degree: MS, Department of Mathematics and Statistics, 2019, University of Guelph

 This thesis attempts to determine whether a modified version of the genetic algorithm developed by Ashlock et al. (2014) could be used to create graphs… (more)

Subjects/Keywords: Parameter Optimization; Genetic Algorithms; Graph Colouring

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kielstra, I. T. (2019). Analysing the Effectiveness of Different Parameter Optimization Techniques for Complex Genetic Algorithmsd. (Masters Thesis). University of Guelph. Retrieved from https://atrium.lib.uoguelph.ca/xmlui/handle/10214/14694

Chicago Manual of Style (16th Edition):

Kielstra, Immanuel Thomas. “Analysing the Effectiveness of Different Parameter Optimization Techniques for Complex Genetic Algorithmsd.” 2019. Masters Thesis, University of Guelph. Accessed October 23, 2020. https://atrium.lib.uoguelph.ca/xmlui/handle/10214/14694.

MLA Handbook (7th Edition):

Kielstra, Immanuel Thomas. “Analysing the Effectiveness of Different Parameter Optimization Techniques for Complex Genetic Algorithmsd.” 2019. Web. 23 Oct 2020.

Vancouver:

Kielstra IT. Analysing the Effectiveness of Different Parameter Optimization Techniques for Complex Genetic Algorithmsd. [Internet] [Masters thesis]. University of Guelph; 2019. [cited 2020 Oct 23]. Available from: https://atrium.lib.uoguelph.ca/xmlui/handle/10214/14694.

Council of Science Editors:

Kielstra IT. Analysing the Effectiveness of Different Parameter Optimization Techniques for Complex Genetic Algorithmsd. [Masters Thesis]. University of Guelph; 2019. Available from: https://atrium.lib.uoguelph.ca/xmlui/handle/10214/14694


University of Victoria

7. Bard, Stefan. Gray code numbers of complete multipartite graphs.

Degree: Department of Mathematics and Statistics, 2014, University of Victoria

 Let G be a graph and k be an integer greater than or equal to the chromatic number of G. The k-colouring graph of G… (more)

Subjects/Keywords: Graph Theory; Hamilton Cycle; Gray Code; Colouring Graph; Connectivity; Complete Multipartite

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Bard, S. (2014). Gray code numbers of complete multipartite graphs. (Masters Thesis). University of Victoria. Retrieved from http://hdl.handle.net/1828/5815

Chicago Manual of Style (16th Edition):

Bard, Stefan. “Gray code numbers of complete multipartite graphs.” 2014. Masters Thesis, University of Victoria. Accessed October 23, 2020. http://hdl.handle.net/1828/5815.

MLA Handbook (7th Edition):

Bard, Stefan. “Gray code numbers of complete multipartite graphs.” 2014. Web. 23 Oct 2020.

Vancouver:

Bard S. Gray code numbers of complete multipartite graphs. [Internet] [Masters thesis]. University of Victoria; 2014. [cited 2020 Oct 23]. Available from: http://hdl.handle.net/1828/5815.

Council of Science Editors:

Bard S. Gray code numbers of complete multipartite graphs. [Masters Thesis]. University of Victoria; 2014. Available from: http://hdl.handle.net/1828/5815


University of Toronto

8. 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 October 23, 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. 23 Oct 2020.

Vancouver:

Soukup DT. Colouring Problems of Erdős and Rado on Infinite Graphs. [Internet] [Doctoral dissertation]. University of Toronto; 2015. [cited 2020 Oct 23]. 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


University of Melbourne

9. JIA, BIN. Link Graphs.

Degree: 2015, University of Melbourne

Graph theory is a branch of mathematics where pair-wise relations between objects are studied. This thesis introduces a new family of graphs, called link graphs,… (more)

Subjects/Keywords: link; link graph; graph colouring; graph minor; Hadwiger’s conjecture; recognition problem; determination problem; NP problem

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

JIA, B. (2015). Link Graphs. (Doctoral Dissertation). University of Melbourne. Retrieved from http://hdl.handle.net/11343/55046

Chicago Manual of Style (16th Edition):

JIA, BIN. “Link Graphs.” 2015. Doctoral Dissertation, University of Melbourne. Accessed October 23, 2020. http://hdl.handle.net/11343/55046.

MLA Handbook (7th Edition):

JIA, BIN. “Link Graphs.” 2015. Web. 23 Oct 2020.

Vancouver:

JIA B. Link Graphs. [Internet] [Doctoral dissertation]. University of Melbourne; 2015. [cited 2020 Oct 23]. Available from: http://hdl.handle.net/11343/55046.

Council of Science Editors:

JIA B. Link Graphs. [Doctoral Dissertation]. University of Melbourne; 2015. Available from: http://hdl.handle.net/11343/55046


University of Ottawa

10. Outioua, Djedjiga. Defect-1 Choosability of Graphs on Surfaces .

Degree: 2020, University of Ottawa

 The classical (proper) graph colouring problem asks for a colouring of the vertices of a graph with the minimum number of colours such that no… (more)

Subjects/Keywords: Graph colouring; Choosability; Defective choosability; Defect; Defective colouring; Choice number; Toroidal graphs; Graph on surfaces; Adjacent triangles

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Outioua, D. (2020). Defect-1 Choosability of Graphs on Surfaces . (Thesis). University of Ottawa. Retrieved from http://hdl.handle.net/10393/40568

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

Outioua, Djedjiga. “Defect-1 Choosability of Graphs on Surfaces .” 2020. Thesis, University of Ottawa. Accessed October 23, 2020. http://hdl.handle.net/10393/40568.

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

MLA Handbook (7th Edition):

Outioua, Djedjiga. “Defect-1 Choosability of Graphs on Surfaces .” 2020. Web. 23 Oct 2020.

Vancouver:

Outioua D. Defect-1 Choosability of Graphs on Surfaces . [Internet] [Thesis]. University of Ottawa; 2020. [cited 2020 Oct 23]. Available from: http://hdl.handle.net/10393/40568.

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

Council of Science Editors:

Outioua D. Defect-1 Choosability of Graphs on Surfaces . [Thesis]. University of Ottawa; 2020. Available from: http://hdl.handle.net/10393/40568

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


University of Helsinki

11. Rybicki, Joel. Exact bounds for distributed graph colouring.

Degree: Department of Computer Science; Helsingfors universitet, Matematisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap, 2011, University of Helsinki

 A distributed system is a collection of networked autonomous processing units which must work in a cooperative manner. Currently, large-scale distributed systems, such as various… (more)

Subjects/Keywords: graph colouring; distributed algorithms; colour reduction; Cole–Vishkin techniques; SAT

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Rybicki, J. (2011). Exact bounds for distributed graph colouring. (Masters Thesis). University of Helsinki. Retrieved from http://hdl.handle.net/10138/26560

Chicago Manual of Style (16th Edition):

Rybicki, Joel. “Exact bounds for distributed graph colouring.” 2011. Masters Thesis, University of Helsinki. Accessed October 23, 2020. http://hdl.handle.net/10138/26560.

MLA Handbook (7th Edition):

Rybicki, Joel. “Exact bounds for distributed graph colouring.” 2011. Web. 23 Oct 2020.

Vancouver:

Rybicki J. Exact bounds for distributed graph colouring. [Internet] [Masters thesis]. University of Helsinki; 2011. [cited 2020 Oct 23]. Available from: http://hdl.handle.net/10138/26560.

Council of Science Editors:

Rybicki J. Exact bounds for distributed graph colouring. [Masters Thesis]. University of Helsinki; 2011. Available from: http://hdl.handle.net/10138/26560


University of Victoria

12. Epple, Dennis D. A. Graph partitions and the bichromatic number.

Degree: Dept. of Mathematics and Statistics, 2011, University of Victoria

 A (k,l)-colouring of a graph is a partition of its vertex set into k independent sets and l cliques. The bichromatic number chib of a… (more)

Subjects/Keywords: Graph Theory; Bichromatic Number; Cochromatic Number; (k,l)-colouring

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Epple, D. D. A. (2011). Graph partitions and the bichromatic number. (Thesis). University of Victoria. Retrieved from http://hdl.handle.net/1828/3514

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

Epple, Dennis D A. “Graph partitions and the bichromatic number.” 2011. Thesis, University of Victoria. Accessed October 23, 2020. http://hdl.handle.net/1828/3514.

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

MLA Handbook (7th Edition):

Epple, Dennis D A. “Graph partitions and the bichromatic number.” 2011. Web. 23 Oct 2020.

Vancouver:

Epple DDA. Graph partitions and the bichromatic number. [Internet] [Thesis]. University of Victoria; 2011. [cited 2020 Oct 23]. Available from: http://hdl.handle.net/1828/3514.

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

Council of Science Editors:

Epple DDA. Graph partitions and the bichromatic number. [Thesis]. University of Victoria; 2011. Available from: http://hdl.handle.net/1828/3514

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


NSYSU

13. 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 October 23, 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. 23 Oct 2020.

Vancouver:

Lin C. The circular chromatic numbers of line graphs and total graphs. [Internet] [Doctoral dissertation]. NSYSU; 2014. [cited 2020 Oct 23]. 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

14. Žnidarič, Luka. Harmonično barvanje dreves.

Degree: 2018, Univerza v Mariboru

Harmonično barvanje grafa je dobro barvanje njegovih vozlišč, tako da se poljuben par različnih barv pojavi na največ enem paru sosednjih vozlišč. Harmonično kromatično število… (more)

Subjects/Keywords: drevesa; barvanje grafov; harmonično barvanje; trees; graph colouring; harmonious colouring; info:eu-repo/classification/udc/519.172:519.174.7(043.2)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Žnidarič, L. (2018). Harmonično barvanje dreves. (Masters Thesis). Univerza v Mariboru. Retrieved from https://dk.um.si/IzpisGradiva.php?id=72167 ; https://dk.um.si/Dokument.php?id=129327&dn= ; https://plus.si.cobiss.net/opac7/bib/24054536?lang=sl

Chicago Manual of Style (16th Edition):

Žnidarič, Luka. “Harmonično barvanje dreves.” 2018. Masters Thesis, Univerza v Mariboru. Accessed October 23, 2020. https://dk.um.si/IzpisGradiva.php?id=72167 ; https://dk.um.si/Dokument.php?id=129327&dn= ; https://plus.si.cobiss.net/opac7/bib/24054536?lang=sl.

MLA Handbook (7th Edition):

Žnidarič, Luka. “Harmonično barvanje dreves.” 2018. Web. 23 Oct 2020.

Vancouver:

Žnidarič L. Harmonično barvanje dreves. [Internet] [Masters thesis]. Univerza v Mariboru; 2018. [cited 2020 Oct 23]. Available from: https://dk.um.si/IzpisGradiva.php?id=72167 ; https://dk.um.si/Dokument.php?id=129327&dn= ; https://plus.si.cobiss.net/opac7/bib/24054536?lang=sl.

Council of Science Editors:

Žnidarič L. Harmonično barvanje dreves. [Masters Thesis]. Univerza v Mariboru; 2018. Available from: https://dk.um.si/IzpisGradiva.php?id=72167 ; https://dk.um.si/Dokument.php?id=129327&dn= ; https://plus.si.cobiss.net/opac7/bib/24054536?lang=sl

15. Melinder, Victor. Upper bounds on the star chromatic index for bipartite graphs.

Degree: Faculty of Science & Engineering, 2020, Linköping UniversityLinköping University

  An area in graph theory is graph colouring, which essentially is a labeling of the vertices or edges according to certain constraints. In this… (more)

Subjects/Keywords: Graph Theory; Star edge colouring; Star chromatic index; Graph colouring; Biregular; Graph; Grafteori; stjärnkantsfärgning; stjärnkromatiskt index; graffärgning; Bireguljär; Graf; Discrete Mathematics; Diskret matematik

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Melinder, V. (2020). Upper bounds on the star chromatic index for bipartite graphs. (Thesis). Linköping UniversityLinköping University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-164938

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

Melinder, Victor. “Upper bounds on the star chromatic index for bipartite graphs.” 2020. Thesis, Linköping UniversityLinköping University. Accessed October 23, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-164938.

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

MLA Handbook (7th Edition):

Melinder, Victor. “Upper bounds on the star chromatic index for bipartite graphs.” 2020. Web. 23 Oct 2020.

Vancouver:

Melinder V. Upper bounds on the star chromatic index for bipartite graphs. [Internet] [Thesis]. Linköping UniversityLinköping University; 2020. [cited 2020 Oct 23]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-164938.

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

Council of Science Editors:

Melinder V. Upper bounds on the star chromatic index for bipartite graphs. [Thesis]. Linköping UniversityLinköping University; 2020. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-164938

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


Brock University

16. Golestanian, Arnoosh. Backbone Colouring of Graphs .

Degree: Department of Mathematics, Brock University

 Consider an undirected graph G and a subgraph of G, H. A q-backbone k-colouring of (G,H) is a mapping f: V(G) {1, 2, ..., k}… (more)

Subjects/Keywords: Graph Theory; Graph Colouring; Planar Graphs; Spanning Tree; Backbone Colouring

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Golestanian, A. (n.d.). Backbone Colouring of Graphs . (Thesis). Brock University. Retrieved from http://hdl.handle.net/10464/7158

Note: this citation may be lacking information needed for this citation format:
No year of publication.
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Golestanian, Arnoosh. “Backbone Colouring of Graphs .” Thesis, Brock University. Accessed October 23, 2020. http://hdl.handle.net/10464/7158.

Note: this citation may be lacking information needed for this citation format:
No year of publication.
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Golestanian, Arnoosh. “Backbone Colouring of Graphs .” Web. 23 Oct 2020.

Note: this citation may be lacking information needed for this citation format:
No year of publication.

Vancouver:

Golestanian A. Backbone Colouring of Graphs . [Internet] [Thesis]. Brock University; [cited 2020 Oct 23]. Available from: http://hdl.handle.net/10464/7158.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
No year of publication.

Council of Science Editors:

Golestanian A. Backbone Colouring of Graphs . [Thesis]. Brock University; Available from: http://hdl.handle.net/10464/7158

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
No year of publication.


University of Waterloo

17. Chowdhury, Ameerah. Colouring Subspaces.

Degree: 2005, University of Waterloo

 This thesis was originally motivated by considering vector space analogues of problems in extremal set theory, but our main results concern colouring a graph that… (more)

Subjects/Keywords: Mathematics; Kneser graph; projective geometry; colouring

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chowdhury, A. (2005). Colouring Subspaces. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/1026

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

Chowdhury, Ameerah. “Colouring Subspaces.” 2005. Thesis, University of Waterloo. Accessed October 23, 2020. http://hdl.handle.net/10012/1026.

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

MLA Handbook (7th Edition):

Chowdhury, Ameerah. “Colouring Subspaces.” 2005. Web. 23 Oct 2020.

Vancouver:

Chowdhury A. Colouring Subspaces. [Internet] [Thesis]. University of Waterloo; 2005. [cited 2020 Oct 23]. Available from: http://hdl.handle.net/10012/1026.

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

Council of Science Editors:

Chowdhury A. Colouring Subspaces. [Thesis]. University of Waterloo; 2005. Available from: http://hdl.handle.net/10012/1026

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

18. Duffy, Christopher. Homomorphisms of (j,k)-mixed graphs : Homomorphisms of (j,k)-mixed graphs.

Degree: Docteur es, Informatique, 2015, Bordeaux; University of Victoria

Un graphe mixte est un graphe simple tel que un sous-ensemble des arêtes a une orientation. Pour entiers non négatifs j et k, un graphe… (more)

Subjects/Keywords: Graphe; Homomorphisme; Graphe orienté; Graphe orientée coloration; Graph; Homomorphism; Oriented Graphs; Oriented colouring

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Duffy, C. (2015). Homomorphisms of (j,k)-mixed graphs : Homomorphisms of (j,k)-mixed graphs. (Doctoral Dissertation). Bordeaux; University of Victoria. Retrieved from http://www.theses.fr/2015BORD0128

Chicago Manual of Style (16th Edition):

Duffy, Christopher. “Homomorphisms of (j,k)-mixed graphs : Homomorphisms of (j,k)-mixed graphs.” 2015. Doctoral Dissertation, Bordeaux; University of Victoria. Accessed October 23, 2020. http://www.theses.fr/2015BORD0128.

MLA Handbook (7th Edition):

Duffy, Christopher. “Homomorphisms of (j,k)-mixed graphs : Homomorphisms of (j,k)-mixed graphs.” 2015. Web. 23 Oct 2020.

Vancouver:

Duffy C. Homomorphisms of (j,k)-mixed graphs : Homomorphisms of (j,k)-mixed graphs. [Internet] [Doctoral dissertation]. Bordeaux; University of Victoria; 2015. [cited 2020 Oct 23]. Available from: http://www.theses.fr/2015BORD0128.

Council of Science Editors:

Duffy C. Homomorphisms of (j,k)-mixed graphs : Homomorphisms of (j,k)-mixed graphs. [Doctoral Dissertation]. Bordeaux; University of Victoria; 2015. Available from: http://www.theses.fr/2015BORD0128

19. Gvozdenovic, Nebojsa. Approximating the stability number and the chromatic number of a graph via semidefinite programming.

Degree: 2008, NARCIS

Subjects/Keywords: semidefinite programming; stable set; graph colouring

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Gvozdenovic, N. (2008). Approximating the stability number and the chromatic number of a graph via semidefinite programming. (Doctoral Dissertation). NARCIS. Retrieved from https://ir.cwi.nl/pub/13402 ; urn:NBN:nl:ui:18-13402 ; https://ir.cwi.nl/pub/13402 ; urn:NBN:nl:ui:18-13402 ; urn:isbn:978-90-6196-546-6 ; urn:NBN:nl:ui:18-13402 ; https://ir.cwi.nl/pub/13402

Chicago Manual of Style (16th Edition):

Gvozdenovic, Nebojsa. “Approximating the stability number and the chromatic number of a graph via semidefinite programming.” 2008. Doctoral Dissertation, NARCIS. Accessed October 23, 2020. https://ir.cwi.nl/pub/13402 ; urn:NBN:nl:ui:18-13402 ; https://ir.cwi.nl/pub/13402 ; urn:NBN:nl:ui:18-13402 ; urn:isbn:978-90-6196-546-6 ; urn:NBN:nl:ui:18-13402 ; https://ir.cwi.nl/pub/13402.

MLA Handbook (7th Edition):

Gvozdenovic, Nebojsa. “Approximating the stability number and the chromatic number of a graph via semidefinite programming.” 2008. Web. 23 Oct 2020.

Vancouver:

Gvozdenovic N. Approximating the stability number and the chromatic number of a graph via semidefinite programming. [Internet] [Doctoral dissertation]. NARCIS; 2008. [cited 2020 Oct 23]. Available from: https://ir.cwi.nl/pub/13402 ; urn:NBN:nl:ui:18-13402 ; https://ir.cwi.nl/pub/13402 ; urn:NBN:nl:ui:18-13402 ; urn:isbn:978-90-6196-546-6 ; urn:NBN:nl:ui:18-13402 ; https://ir.cwi.nl/pub/13402.

Council of Science Editors:

Gvozdenovic N. Approximating the stability number and the chromatic number of a graph via semidefinite programming. [Doctoral Dissertation]. NARCIS; 2008. Available from: https://ir.cwi.nl/pub/13402 ; urn:NBN:nl:ui:18-13402 ; https://ir.cwi.nl/pub/13402 ; urn:NBN:nl:ui:18-13402 ; urn:isbn:978-90-6196-546-6 ; urn:NBN:nl:ui:18-13402 ; https://ir.cwi.nl/pub/13402


University of Oxford

20. 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 October 23, 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. 23 Oct 2020.

Vancouver:

Heckel A. Colourings of random graphs. [Internet] [Doctoral dissertation]. University of Oxford; 2016. [cited 2020 Oct 23]. 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


University of Oxford

21. Meeks, Kitty M. F. T. Graph colourings and games.

Degree: PhD, 2012, University of Oxford

Graph colourings and combinatorial games are two very widely studied topics in discrete mathematics. This thesis addresses the computational complexity of a range of problems… (more)

Subjects/Keywords: 511.6; Combinatorics; Computer science (mathematics); Applications and algorithms; graph theory; games on graphs; graph colouring; algorithms; computational complexity; parameterised complexity

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Meeks, K. M. F. T. (2012). Graph colourings and games. (Doctoral Dissertation). University of Oxford. Retrieved from http://ora.ox.ac.uk/objects/uuid:a805a379-f891-4250-9a7d-df109f9f52e2 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.581116

Chicago Manual of Style (16th Edition):

Meeks, Kitty M F T. “Graph colourings and games.” 2012. Doctoral Dissertation, University of Oxford. Accessed October 23, 2020. http://ora.ox.ac.uk/objects/uuid:a805a379-f891-4250-9a7d-df109f9f52e2 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.581116.

MLA Handbook (7th Edition):

Meeks, Kitty M F T. “Graph colourings and games.” 2012. Web. 23 Oct 2020.

Vancouver:

Meeks KMFT. Graph colourings and games. [Internet] [Doctoral dissertation]. University of Oxford; 2012. [cited 2020 Oct 23]. Available from: http://ora.ox.ac.uk/objects/uuid:a805a379-f891-4250-9a7d-df109f9f52e2 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.581116.

Council of Science Editors:

Meeks KMFT. Graph colourings and games. [Doctoral Dissertation]. University of Oxford; 2012. Available from: http://ora.ox.ac.uk/objects/uuid:a805a379-f891-4250-9a7d-df109f9f52e2 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.581116

22. Pirot, Francois. Coloration de graphes épars : Colouring sparse graphs.

Degree: Docteur es, Informatique, 2019, Université de Lorraine; Radboud universiteit Nijmegen

 Cette thèse a pour thème la coloration de diverses classes de graphes épars. Shearer montra en 1983 [She83] que le ratio d'indépendance des graphes sans… (more)

Subjects/Keywords: Coloration de graphes; Méthode probabiliste; Combinatoire extrémale; Graph colouring; Probabilistic method; Extremal combinatorics; 511.502 85; 511.6

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Pirot, F. (2019). Coloration de graphes épars : Colouring sparse graphs. (Doctoral Dissertation). Université de Lorraine; Radboud universiteit Nijmegen. Retrieved from http://www.theses.fr/2019LORR0153

Chicago Manual of Style (16th Edition):

Pirot, Francois. “Coloration de graphes épars : Colouring sparse graphs.” 2019. Doctoral Dissertation, Université de Lorraine; Radboud universiteit Nijmegen. Accessed October 23, 2020. http://www.theses.fr/2019LORR0153.

MLA Handbook (7th Edition):

Pirot, Francois. “Coloration de graphes épars : Colouring sparse graphs.” 2019. Web. 23 Oct 2020.

Vancouver:

Pirot F. Coloration de graphes épars : Colouring sparse graphs. [Internet] [Doctoral dissertation]. Université de Lorraine; Radboud universiteit Nijmegen; 2019. [cited 2020 Oct 23]. Available from: http://www.theses.fr/2019LORR0153.

Council of Science Editors:

Pirot F. Coloration de graphes épars : Colouring sparse graphs. [Doctoral Dissertation]. Université de Lorraine; Radboud universiteit Nijmegen; 2019. Available from: http://www.theses.fr/2019LORR0153


University of Waterloo

23. Pei, Martin. List colouring hypergraphs and extremal results for acyclic graphs.

Degree: 2008, University of Waterloo

 We study several extremal problems in graphs and hypergraphs. The first one is on list-colouring hypergraphs, which is a generalization of the ordinary colouring of… (more)

Subjects/Keywords: graphs; hypergraphs; extremal graph theory; list colouring; tree embedding

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Pei, M. (2008). List colouring hypergraphs and extremal results for acyclic graphs. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/3715

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

Pei, Martin. “List colouring hypergraphs and extremal results for acyclic graphs.” 2008. Thesis, University of Waterloo. Accessed October 23, 2020. http://hdl.handle.net/10012/3715.

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

MLA Handbook (7th Edition):

Pei, Martin. “List colouring hypergraphs and extremal results for acyclic graphs.” 2008. Web. 23 Oct 2020.

Vancouver:

Pei M. List colouring hypergraphs and extremal results for acyclic graphs. [Internet] [Thesis]. University of Waterloo; 2008. [cited 2020 Oct 23]. Available from: http://hdl.handle.net/10012/3715.

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

Council of Science Editors:

Pei M. List colouring hypergraphs and extremal results for acyclic graphs. [Thesis]. University of Waterloo; 2008. Available from: http://hdl.handle.net/10012/3715

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


University of Waterloo

24. McDonald, Jessica. Multigraphs with High Chromatic Index.

Degree: 2009, University of Waterloo

 In this thesis we take a specialized approach to edge-colouring by focusing exclusively on multigraphs with high chromatic index. The bulk of our results can… (more)

Subjects/Keywords: graph theory; edge-colouring; chromatic index; multigraphs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

McDonald, J. (2009). Multigraphs with High Chromatic Index. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/4511

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

McDonald, Jessica. “Multigraphs with High Chromatic Index.” 2009. Thesis, University of Waterloo. Accessed October 23, 2020. http://hdl.handle.net/10012/4511.

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

MLA Handbook (7th Edition):

McDonald, Jessica. “Multigraphs with High Chromatic Index.” 2009. Web. 23 Oct 2020.

Vancouver:

McDonald J. Multigraphs with High Chromatic Index. [Internet] [Thesis]. University of Waterloo; 2009. [cited 2020 Oct 23]. Available from: http://hdl.handle.net/10012/4511.

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

Council of Science Editors:

McDonald J. Multigraphs with High Chromatic Index. [Thesis]. University of Waterloo; 2009. Available from: http://hdl.handle.net/10012/4511

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


University of Oxford

25. Kang, Ross J. Improper colourings of graphs.

Degree: PhD, 2008, University of Oxford

 We consider a generalisation of proper vertex colouring of graphs, referred to as improper colouring, in which each vertex can only be adjacent to a… (more)

Subjects/Keywords: 511; Combinatorics; Computer science (mathematics); Discrete mathematics (statistics); graph colouring; probabilistic combinatorics; random graphs; unit disk graphs; telecommunications; improper colouring; acyclic colouring; frugal colouring

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kang, R. J. (2008). Improper colourings of graphs. (Doctoral Dissertation). University of Oxford. Retrieved from http://ora.ox.ac.uk/objects/uuid:a93d8303-0eeb-4d01-9b77-364113b81a63 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.491626

Chicago Manual of Style (16th Edition):

Kang, Ross J. “Improper colourings of graphs.” 2008. Doctoral Dissertation, University of Oxford. Accessed October 23, 2020. http://ora.ox.ac.uk/objects/uuid:a93d8303-0eeb-4d01-9b77-364113b81a63 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.491626.

MLA Handbook (7th Edition):

Kang, Ross J. “Improper colourings of graphs.” 2008. Web. 23 Oct 2020.

Vancouver:

Kang RJ. Improper colourings of graphs. [Internet] [Doctoral dissertation]. University of Oxford; 2008. [cited 2020 Oct 23]. Available from: http://ora.ox.ac.uk/objects/uuid:a93d8303-0eeb-4d01-9b77-364113b81a63 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.491626.

Council of Science Editors:

Kang RJ. Improper colourings of graphs. [Doctoral Dissertation]. University of Oxford; 2008. Available from: http://ora.ox.ac.uk/objects/uuid:a93d8303-0eeb-4d01-9b77-364113b81a63 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.491626


University of Victoria

26. Campbell, Russell J. Reflexive injective oriented colourings.

Degree: Dept. of Mathematics and Statistics, 2009, University of Victoria

 We define a variation of injective oriented colouring as reflexive injective oriented colouring, or rio-colouring for short, which requires an oriented colouring to be injective… (more)

Subjects/Keywords: Colouring; Digraph; Oriented Graph; Graph Theory; Tree; Rio-colouring; Graph Homomorphism; Chromatic Number; UVic Subject Index::Sciences and Engineering::Mathematics::Pure mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Campbell, R. J. (2009). Reflexive injective oriented colourings. (Masters Thesis). University of Victoria. Retrieved from http://hdl.handle.net/1828/2013

Chicago Manual of Style (16th Edition):

Campbell, Russell J. “Reflexive injective oriented colourings.” 2009. Masters Thesis, University of Victoria. Accessed October 23, 2020. http://hdl.handle.net/1828/2013.

MLA Handbook (7th Edition):

Campbell, Russell J. “Reflexive injective oriented colourings.” 2009. Web. 23 Oct 2020.

Vancouver:

Campbell RJ. Reflexive injective oriented colourings. [Internet] [Masters thesis]. University of Victoria; 2009. [cited 2020 Oct 23]. Available from: http://hdl.handle.net/1828/2013.

Council of Science Editors:

Campbell RJ. Reflexive injective oriented colourings. [Masters Thesis]. University of Victoria; 2009. Available from: http://hdl.handle.net/1828/2013

27. Minot, Maël. Investigating decomposition methods for the maximum common subgraph and sum colouring problems : Utilisation de méthodes de décomposition pour les problèmes du plus grand sous-graphe commun et de la somme coloration.

Degree: Docteur es, Informatique, 2017, Lyon

Notre objectif est d’évaluer et de rendre opérationnelle la décomposition de problèmes d’optimisation sous contraintes. Nous nous sommes intéressés à deux problèmes en particulier : le… (more)

Subjects/Keywords: Informatique; Programmation par contraintes; Programmation linéaire; Optimisation combinée; Graphe; Isomorphisme; Coloration; Portfolio; Information Technology; Constraint programming; Linear programming; Combinatorial optimisation; Graph; Isomorphism; Colouring; Portfolio; 005.110 72

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Minot, M. (2017). Investigating decomposition methods for the maximum common subgraph and sum colouring problems : Utilisation de méthodes de décomposition pour les problèmes du plus grand sous-graphe commun et de la somme coloration. (Doctoral Dissertation). Lyon. Retrieved from http://www.theses.fr/2017LYSEI120

Chicago Manual of Style (16th Edition):

Minot, Maël. “Investigating decomposition methods for the maximum common subgraph and sum colouring problems : Utilisation de méthodes de décomposition pour les problèmes du plus grand sous-graphe commun et de la somme coloration.” 2017. Doctoral Dissertation, Lyon. Accessed October 23, 2020. http://www.theses.fr/2017LYSEI120.

MLA Handbook (7th Edition):

Minot, Maël. “Investigating decomposition methods for the maximum common subgraph and sum colouring problems : Utilisation de méthodes de décomposition pour les problèmes du plus grand sous-graphe commun et de la somme coloration.” 2017. Web. 23 Oct 2020.

Vancouver:

Minot M. Investigating decomposition methods for the maximum common subgraph and sum colouring problems : Utilisation de méthodes de décomposition pour les problèmes du plus grand sous-graphe commun et de la somme coloration. [Internet] [Doctoral dissertation]. Lyon; 2017. [cited 2020 Oct 23]. Available from: http://www.theses.fr/2017LYSEI120.

Council of Science Editors:

Minot M. Investigating decomposition methods for the maximum common subgraph and sum colouring problems : Utilisation de méthodes de décomposition pour les problèmes du plus grand sous-graphe commun et de la somme coloration. [Doctoral Dissertation]. Lyon; 2017. Available from: http://www.theses.fr/2017LYSEI120


University of Waterloo

28. Farrugia, Alastair. Uniqueness and Complexity in Generalised Colouring.

Degree: 2003, University of Waterloo

 The study and recognition of graph families (or graph properties) is an essential part of combinatorics. Graph colouring is another fundamental concept of graph theory… (more)

Subjects/Keywords: Mathematics; graph; graph property; vertex partition; graph colouring; hereditary; induced-hereditary; compositive; complexity; uniquely colourable graphs; uniquely partitionable graphs; unique factorisation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Farrugia, A. (2003). Uniqueness and Complexity in Generalised Colouring. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/1018

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

Farrugia, Alastair. “Uniqueness and Complexity in Generalised Colouring.” 2003. Thesis, University of Waterloo. Accessed October 23, 2020. http://hdl.handle.net/10012/1018.

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

MLA Handbook (7th Edition):

Farrugia, Alastair. “Uniqueness and Complexity in Generalised Colouring.” 2003. Web. 23 Oct 2020.

Vancouver:

Farrugia A. Uniqueness and Complexity in Generalised Colouring. [Internet] [Thesis]. University of Waterloo; 2003. [cited 2020 Oct 23]. Available from: http://hdl.handle.net/10012/1018.

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

Council of Science Editors:

Farrugia A. Uniqueness and Complexity in Generalised Colouring. [Thesis]. University of Waterloo; 2003. Available from: http://hdl.handle.net/10012/1018

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


University of Oxford

29. Noel, Jonathan A. Extremal combinatorics, graph limits and computational complexity.

Degree: PhD, 2016, University of Oxford

 This thesis is primarily focused on problems in extremal combinatorics, although we will also consider some questions of analytic and algorithmic nature. The d-dimensional hypercube… (more)

Subjects/Keywords: 511; Combinatorial analysis; Computational complexity; Graph coloring; Graph theory; Combinatorial probabilities; Percolation (Statistical physics) – Mathematical models; Extremal problems (Mathematics); Mathematics; Saturation Problems; Weak Saturation; Circular Colouring; Antichains in Random Posets; Sperner Theory; Bootstrap Percolation; Combinatorial Reconfiguration; Counting Antichains; Weak Regularity; Supersaturation in Posets; Graph Limits

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Noel, J. A. (2016). Extremal combinatorics, graph limits and computational complexity. (Doctoral Dissertation). University of Oxford. Retrieved from http://ora.ox.ac.uk/objects/uuid:8743ff27-b5e9-403a-a52a-3d6299792c7b ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.728769

Chicago Manual of Style (16th Edition):

Noel, Jonathan A. “Extremal combinatorics, graph limits and computational complexity.” 2016. Doctoral Dissertation, University of Oxford. Accessed October 23, 2020. http://ora.ox.ac.uk/objects/uuid:8743ff27-b5e9-403a-a52a-3d6299792c7b ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.728769.

MLA Handbook (7th Edition):

Noel, Jonathan A. “Extremal combinatorics, graph limits and computational complexity.” 2016. Web. 23 Oct 2020.

Vancouver:

Noel JA. Extremal combinatorics, graph limits and computational complexity. [Internet] [Doctoral dissertation]. University of Oxford; 2016. [cited 2020 Oct 23]. Available from: http://ora.ox.ac.uk/objects/uuid:8743ff27-b5e9-403a-a52a-3d6299792c7b ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.728769.

Council of Science Editors:

Noel JA. Extremal combinatorics, graph limits and computational complexity. [Doctoral Dissertation]. University of Oxford; 2016. Available from: http://ora.ox.ac.uk/objects/uuid:8743ff27-b5e9-403a-a52a-3d6299792c7b ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.728769


ETH Zürich

30. Panagiotou, Konstantinos. Colorability properties of random graphs.

Degree: 2008, ETH Zürich

Subjects/Keywords: EXTREMAL PROBLEMS (GRAPH THEORY); RANDOM GRAPHS (GRAPH THEORY); COLOURING OF GRAPHS (GRAPH THEORY); EXTREMALPROBLEME (GRAPHENTHEORIE); ZUFALLSGRAPHEN (GRAPHENTHEORIE); FARBENPROBLEME (GRAPHENTHEORIE); 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):

Panagiotou, K. (2008). Colorability properties of random graphs. (Doctoral Dissertation). ETH Zürich. Retrieved from http://hdl.handle.net/20.500.11850/72900

Chicago Manual of Style (16th Edition):

Panagiotou, Konstantinos. “Colorability properties of random graphs.” 2008. Doctoral Dissertation, ETH Zürich. Accessed October 23, 2020. http://hdl.handle.net/20.500.11850/72900.

MLA Handbook (7th Edition):

Panagiotou, Konstantinos. “Colorability properties of random graphs.” 2008. Web. 23 Oct 2020.

Vancouver:

Panagiotou K. Colorability properties of random graphs. [Internet] [Doctoral dissertation]. ETH Zürich; 2008. [cited 2020 Oct 23]. Available from: http://hdl.handle.net/20.500.11850/72900.

Council of Science Editors:

Panagiotou K. Colorability properties of random graphs. [Doctoral Dissertation]. ETH Zürich; 2008. Available from: http://hdl.handle.net/20.500.11850/72900

[1] [2]

.