Browse Dissertations and Theses - Mathematics by Subject "Graph Coloring"

  • Kumbhat, Mohit (2012-05-22)
    In this thesis we study some extremal problems related to colorings and list colorings of graphs and hypergraphs. One of the main problems that we study is: What is the minimum number of edges in an $r$-uniform hypergraph ...

    application/pdf

    application/pdfPDF (502kB)
  • Jahanbekam, Sogol (2013-08-22)
    We study several extremal problems in graph labelling and in weak diameter of digraphs. In Chapter 2 we apply the Discharging Method to prove the 1,2,3-Conjecture [41] and the 1,2-Conjecture [48] for graphs with maximum ...

    application/pdf

    application/pdfPDF (1MB)
  • Kim, Jaehoon (2014-05-30)
    In this thesis, we study extremal problems involving forbidden subgraphs. We are interested in extremal problems over a family of graphs or over a family of hypergraphs. In Chapter 2, we consider improper coloring of ...

    application/pdf

    application/pdfPDF (545kB)
  • Choi, Ilkyoo (2014-05-30)
    This thesis investigates various coloring problems in graph theory. Graph coloring is an essential part of combinatorics and discrete mathematics, as it deals with the fundamental problem of partitioning objects so that ...

    application/pdf

    application/pdfPDF (623kB)