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:(Kneser). Showing records 1 – 10 of 10 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


University of Waterloo

1. Gorodezky, Igor. Dominating sets in Kneser graphs.

Degree: 2007, University of Waterloo

 This thesis investigates dominating sets in Kneser graphs as well as a selection of other topics related to graph domination. Dominating sets in Kneser graphs,… (more)

Subjects/Keywords: graph domination; kneser graphs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Gorodezky, I. (2007). Dominating sets in Kneser graphs. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/3190

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

Gorodezky, Igor. “Dominating sets in Kneser graphs.” 2007. Thesis, University of Waterloo. Accessed September 19, 2020. http://hdl.handle.net/10012/3190.

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

MLA Handbook (7th Edition):

Gorodezky, Igor. “Dominating sets in Kneser graphs.” 2007. Web. 19 Sep 2020.

Vancouver:

Gorodezky I. Dominating sets in Kneser graphs. [Internet] [Thesis]. University of Waterloo; 2007. [cited 2020 Sep 19]. Available from: http://hdl.handle.net/10012/3190.

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

Council of Science Editors:

Gorodezky I. Dominating sets in Kneser graphs. [Thesis]. University of Waterloo; 2007. Available from: http://hdl.handle.net/10012/3190

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


NSYSU

2. 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 September 19, 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. 19 Sep 2020.

Vancouver:

Hsieh C. Circular chromatic number of Kneser Graphs. [Internet] [Thesis]. NSYSU; 2004. [cited 2020 Sep 19]. 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

3. COSTA, Filipe Andrade da. Análise qualitativa de equações diferenciais abstratas .

Degree: 2016, Universidade Federal de Pernambuco

 Nesse trabalho estaremos interessados em estudar propriedades relacionadas as soluções brandas para certos tipos de equações de evoluções. Dentre tais propriedades estudamos a existência de… (more)

Subjects/Keywords: Equações de evolução; Retardo dependendo do estado; Periodicidade; Estruturas flexíveis; Propriedade de Kneser; Solução branda; Evolution equations; State dependence delay; Periodicity; Flexible structure; Kneser property; Mild solution

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

COSTA, F. A. d. (2016). Análise qualitativa de equações diferenciais abstratas . (Doctoral Dissertation). Universidade Federal de Pernambuco. Retrieved from https://repositorio.ufpe.br/handle/123456789/18943

Chicago Manual of Style (16th Edition):

COSTA, Filipe Andrade da. “Análise qualitativa de equações diferenciais abstratas .” 2016. Doctoral Dissertation, Universidade Federal de Pernambuco. Accessed September 19, 2020. https://repositorio.ufpe.br/handle/123456789/18943.

MLA Handbook (7th Edition):

COSTA, Filipe Andrade da. “Análise qualitativa de equações diferenciais abstratas .” 2016. Web. 19 Sep 2020.

Vancouver:

COSTA FAd. Análise qualitativa de equações diferenciais abstratas . [Internet] [Doctoral dissertation]. Universidade Federal de Pernambuco; 2016. [cited 2020 Sep 19]. Available from: https://repositorio.ufpe.br/handle/123456789/18943.

Council of Science Editors:

COSTA FAd. Análise qualitativa de equações diferenciais abstratas . [Doctoral Dissertation]. Universidade Federal de Pernambuco; 2016. Available from: https://repositorio.ufpe.br/handle/123456789/18943

4. Mégarbané, Thomas. Sur les représentations automorphes non ramifiées des groupes linéaires sur Q de petits rangs. : About non-ramified automorphic representations of linear groups over Q for low ranks.

Degree: Docteur es, Mathématiques fondamentales, 2016, Université Paris-Saclay (ComUE)

Cette thèse est consacrée à l'étude des représentations automorphes algébriques des groupes linéaires découvertes par Chenevier-Renard. On s'intéresse plus particulièrement à leurs paramètres de Satake.… (more)

Subjects/Keywords: Théorie des nombres; Formes automorphes; Opérateurs de Hecke; Voisins de Kneser; Paramètres de Satake; Number theory; Automorphic representations; Hecke operators; Kneser neighbours; Satake parameters

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Mégarbané, T. (2016). Sur les représentations automorphes non ramifiées des groupes linéaires sur Q de petits rangs. : About non-ramified automorphic representations of linear groups over Q for low ranks. (Doctoral Dissertation). Université Paris-Saclay (ComUE). Retrieved from http://www.theses.fr/2016SACLX046

Chicago Manual of Style (16th Edition):

Mégarbané, Thomas. “Sur les représentations automorphes non ramifiées des groupes linéaires sur Q de petits rangs. : About non-ramified automorphic representations of linear groups over Q for low ranks.” 2016. Doctoral Dissertation, Université Paris-Saclay (ComUE). Accessed September 19, 2020. http://www.theses.fr/2016SACLX046.

MLA Handbook (7th Edition):

Mégarbané, Thomas. “Sur les représentations automorphes non ramifiées des groupes linéaires sur Q de petits rangs. : About non-ramified automorphic representations of linear groups over Q for low ranks.” 2016. Web. 19 Sep 2020.

Vancouver:

Mégarbané T. Sur les représentations automorphes non ramifiées des groupes linéaires sur Q de petits rangs. : About non-ramified automorphic representations of linear groups over Q for low ranks. [Internet] [Doctoral dissertation]. Université Paris-Saclay (ComUE); 2016. [cited 2020 Sep 19]. Available from: http://www.theses.fr/2016SACLX046.

Council of Science Editors:

Mégarbané T. Sur les représentations automorphes non ramifiées des groupes linéaires sur Q de petits rangs. : About non-ramified automorphic representations of linear groups over Q for low ranks. [Doctoral Dissertation]. Université Paris-Saclay (ComUE); 2016. Available from: http://www.theses.fr/2016SACLX046


University of Waterloo

5. 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 September 19, 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. 19 Sep 2020.

Vancouver:

Chowdhury A. Colouring Subspaces. [Internet] [Thesis]. University of Waterloo; 2005. [cited 2020 Sep 19]. 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


NSYSU

6. Lin, Shu-yuan. Simultaneously Uniquely Circular Colourable and Uniquely Fractional Colourable Graphs.

Degree: PhD, Applied Mathematics, 2006, NSYSU

 This thesie discusses uniquely circular colourable and uniquely fractional colourable graphs. Suppose G = (V;E) is a graph and r ¸ 2 is a real… (more)

Subjects/Keywords: uniquely circular colourable; uiquely fractional colourable; Kneser graph

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lin, S. (2006). Simultaneously Uniquely Circular Colourable and Uniquely Fractional Colourable Graphs. (Doctoral Dissertation). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0125106-114359

Chicago Manual of Style (16th Edition):

Lin, Shu-yuan. “Simultaneously Uniquely Circular Colourable and Uniquely Fractional Colourable Graphs.” 2006. Doctoral Dissertation, NSYSU. Accessed September 19, 2020. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0125106-114359.

MLA Handbook (7th Edition):

Lin, Shu-yuan. “Simultaneously Uniquely Circular Colourable and Uniquely Fractional Colourable Graphs.” 2006. Web. 19 Sep 2020.

Vancouver:

Lin S. Simultaneously Uniquely Circular Colourable and Uniquely Fractional Colourable Graphs. [Internet] [Doctoral dissertation]. NSYSU; 2006. [cited 2020 Sep 19]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0125106-114359.

Council of Science Editors:

Lin S. Simultaneously Uniquely Circular Colourable and Uniquely Fractional Colourable Graphs. [Doctoral Dissertation]. NSYSU; 2006. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0125106-114359


University of Waterloo

7. Roberson, David E. The Graphs of HU+00E4ggkvist & Hell.

Degree: 2009, University of Waterloo

 This thesis investigates HU+00E4ggkvist & Hell graphs. These graphs are an extension of the idea of Kneser graphs, and as such share many attributes with… (more)

Subjects/Keywords: graphs; algebraic graph theory; Haggkvist; Hell; ratio bound; Kneser

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Roberson, D. E. (2009). The Graphs of HU+00E4ggkvist & Hell. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/4197

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

Roberson, David E. “The Graphs of HU+00E4ggkvist & Hell.” 2009. Thesis, University of Waterloo. Accessed September 19, 2020. http://hdl.handle.net/10012/4197.

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

MLA Handbook (7th Edition):

Roberson, David E. “The Graphs of HU+00E4ggkvist & Hell.” 2009. Web. 19 Sep 2020.

Vancouver:

Roberson DE. The Graphs of HU+00E4ggkvist & Hell. [Internet] [Thesis]. University of Waterloo; 2009. [cited 2020 Sep 19]. Available from: http://hdl.handle.net/10012/4197.

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

Council of Science Editors:

Roberson DE. The Graphs of HU+00E4ggkvist & Hell. [Thesis]. University of Waterloo; 2009. Available from: http://hdl.handle.net/10012/4197

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


University of Melbourne

8. Harvey, Daniel John. On Treewidth and Graph Minors.

Degree: 2014, University of Melbourne

 Both treewidth and the Hadwiger number are key graph parameters in structural and algorithmic graph theory, especially in the theory of graph minors. For example,… (more)

Subjects/Keywords: graph theory; treewidth; parameters tied to treewidth; line graphs; Kneser graphs; Erdős-Ko-Rado Theorem; graph minors; graph algorithms; Hadwiger number; Hadwiger conjecture; circular arc graphs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Harvey, D. J. (2014). On Treewidth and Graph Minors. (Doctoral Dissertation). University of Melbourne. Retrieved from http://hdl.handle.net/11343/40752

Chicago Manual of Style (16th Edition):

Harvey, Daniel John. “On Treewidth and Graph Minors.” 2014. Doctoral Dissertation, University of Melbourne. Accessed September 19, 2020. http://hdl.handle.net/11343/40752.

MLA Handbook (7th Edition):

Harvey, Daniel John. “On Treewidth and Graph Minors.” 2014. Web. 19 Sep 2020.

Vancouver:

Harvey DJ. On Treewidth and Graph Minors. [Internet] [Doctoral dissertation]. University of Melbourne; 2014. [cited 2020 Sep 19]. Available from: http://hdl.handle.net/11343/40752.

Council of Science Editors:

Harvey DJ. On Treewidth and Graph Minors. [Doctoral Dissertation]. University of Melbourne; 2014. Available from: http://hdl.handle.net/11343/40752


ETH Zürich

9. Nummenpalo, Jerri. Middle Levels Theorem, Odd Graph Hamiltonicity and Satisfiability Sampling.

Degree: 2019, ETH Zürich

Subjects/Keywords: Hamilton cycle; Kneser graph; Gray code; Satisfiability; 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):

Nummenpalo, J. (2019). Middle Levels Theorem, Odd Graph Hamiltonicity and Satisfiability Sampling. (Doctoral Dissertation). ETH Zürich. Retrieved from http://hdl.handle.net/20.500.11850/339332

Chicago Manual of Style (16th Edition):

Nummenpalo, Jerri. “Middle Levels Theorem, Odd Graph Hamiltonicity and Satisfiability Sampling.” 2019. Doctoral Dissertation, ETH Zürich. Accessed September 19, 2020. http://hdl.handle.net/20.500.11850/339332.

MLA Handbook (7th Edition):

Nummenpalo, Jerri. “Middle Levels Theorem, Odd Graph Hamiltonicity and Satisfiability Sampling.” 2019. Web. 19 Sep 2020.

Vancouver:

Nummenpalo J. Middle Levels Theorem, Odd Graph Hamiltonicity and Satisfiability Sampling. [Internet] [Doctoral dissertation]. ETH Zürich; 2019. [cited 2020 Sep 19]. Available from: http://hdl.handle.net/20.500.11850/339332.

Council of Science Editors:

Nummenpalo J. Middle Levels Theorem, Odd Graph Hamiltonicity and Satisfiability Sampling. [Doctoral Dissertation]. ETH Zürich; 2019. Available from: http://hdl.handle.net/20.500.11850/339332

10. Quintero Ospina , Rodolfo Alexander. Conjetura de Kneser y aplicaciones de la topología algebraica a combinatoria .

Degree: 2013, Universidad de los Andes

 La conjetura de Martin Kneser, y posteriormente, la prueba de la misma por László Lovász, fueron acaso los mayores incentivos para prestar seria atención a… (more)

Subjects/Keywords: Kneser; conjetura; complejo simplicial; Borsuk; Ulam; Lovázs; grafo; índice; producto borrado; join borrado; función equivariante; encajamiento; topología; combinatoria; homología; grupo fundamental; espacio recubridor; levantamiento; hiperplano; politopo; convexo; coloramiento; conjecture; simplicial complex; deleted join; equivariant function; index; graph; embedding; topology; combinatorics; homology; fundamental group; lift; polytope; convex; coloring; hyperplane; covering space

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Quintero Ospina , R. A. (2013). Conjetura de Kneser y aplicaciones de la topología algebraica a combinatoria . (Thesis). Universidad de los Andes. Retrieved from http://documentodegrado.uniandes.edu.co/documentos/200916259_fecha_2014_01_23_hora_19_16_35_parte_1.pdf

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

Quintero Ospina , Rodolfo Alexander. “Conjetura de Kneser y aplicaciones de la topología algebraica a combinatoria .” 2013. Thesis, Universidad de los Andes. Accessed September 19, 2020. http://documentodegrado.uniandes.edu.co/documentos/200916259_fecha_2014_01_23_hora_19_16_35_parte_1.pdf.

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

MLA Handbook (7th Edition):

Quintero Ospina , Rodolfo Alexander. “Conjetura de Kneser y aplicaciones de la topología algebraica a combinatoria .” 2013. Web. 19 Sep 2020.

Vancouver:

Quintero Ospina RA. Conjetura de Kneser y aplicaciones de la topología algebraica a combinatoria . [Internet] [Thesis]. Universidad de los Andes; 2013. [cited 2020 Sep 19]. Available from: http://documentodegrado.uniandes.edu.co/documentos/200916259_fecha_2014_01_23_hora_19_16_35_parte_1.pdf.

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

Council of Science Editors:

Quintero Ospina RA. Conjetura de Kneser y aplicaciones de la topología algebraica a combinatoria . [Thesis]. Universidad de los Andes; 2013. Available from: http://documentodegrado.uniandes.edu.co/documentos/200916259_fecha_2014_01_23_hora_19_16_35_parte_1.pdf

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

.