Scribd Logo
Upload

Welcome to Scribd!

  • 53 views

    Discrete Mathematics: Graph Theory 4

    Uploaded by

    subir123456
    The document discusses graph coloring, which is the process of assigning colors to the vertices of a graph such that no two adjacent vertices have the same color. This is called a proper coloring. The minimum number of colors needed to properly color a graph is its chromatic number. Some key points made include: - A graph containing a complete subgraph of r vertices is at least r-chromatic - A cycle graph with n vertices is 2-chromatic if n is even, and 3-chromatic if n is odd - Every tree with two or more vertices is 2-chromatic - The chromatic number of any graph G is at most the maximum degree of any vertex in G plus 1

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    Discrete Mathematics: Graph Theory 4

    Uploaded by

    subir123456
    53 views7 pages
    The document discusses graph coloring, which is the process of assigning colors to the vertices of a graph such that no two adjacent vertices have the same color. This is called a proper coloring. The minimum number of colors needed to properly color a graph is its chromatic number. Some key points made include: - A graph containing a complete subgraph of r vertices is at least r-chromatic - A cycle graph with n vertices is 2-chromatic if n is even, and 3-chromatic if n is odd - Every tree with two or more vertices is 2-chromatic - The chromatic number of any graph G is at most the maximum degree of any vertex in G plus 1

    Original Description:

    theory on graphs

    Original Title

    Graph Theory34

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document discusses graph coloring, which is the process of assigning colors to the vertices of a graph such that no two adjacent vertices have the same color. This is called a proper coloring. The minimum number of colors needed to properly color a graph is its chromatic number. Some key points made include: - A graph containing a complete subgraph of r vertices is at least r-chromatic - A cycle graph with n vertices is 2-chromatic if n is even, and 3-chromatic if n is odd - Every tree with two or more vertices is 2-chromatic - The chromatic number of any graph G is at most the maximum degree of any vertex in G plus 1

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    53 views7 pages

    Discrete Mathematics: Graph Theory 4

    Uploaded by

    subir123456
    The document discusses graph coloring, which is the process of assigning colors to the vertices of a graph such that no two adjacent vertices have the same color. This is called a proper coloring. The minimum number of colors needed to properly color a graph is its chromatic number. Some key points made include: - A graph containing a complete subgraph of r vertices is at least r-chromatic - A cycle graph with n vertices is 2-chromatic if n is even, and 3-chromatic if n is odd - Every tree with two or more vertices is 2-chromatic - The chromatic number of any graph G is at most the maximum degree of any vertex in G plus 1

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    You are on page 1of 7

    Discrete Mathematics

    GRAPH THEORY 4

    Arindam Chakravorty
    Graph Coloring

    Graph Coloring - Process of assigning colors to the vertices of a graph, such


    that no two adjacent vertices of the graph are colored with the same color.
    In other words, the end vertices of no edge should have the same color.

    This process of assigning colors to the vertices of a graph is called proper


    coloring.
    Graph Coloring

    The maximum number of colors that you can use is equal to the number of
    vertices (in the given figure = 6).
    Our concern is what is the minimum number of colors required to properly
    color a graph?
    The given graph may be colored with a minimum of 2 colors.
    Graph Coloring

    A graph containing a complete graph of r-vertices is at least r-chromatic.


    For example every graph having a triangle is at least 3-chromatic.
    Graph Coloring

    A cycle graph with n vertices is 2-chromatic if n is even and 3-chromatic if n


    is odd.

    Every tree with two or more vertices is 2-chromatic.


    Graph Coloring

    Let 𝐺 be a nonempty graph. Then 𝜒 𝐺 = 2 if and only if 𝐺 is bipartite.


    -Proof left as an exercise

    A tree is a bipartite graph.

    A graph with at least one edge is 2-chromatic if and only if it has no cycle of odd
    length.
    Let G be a connected graph with no odd cycle. G

    Consider any spanning tree T of G and color it. T

    Add the chords to tree. Since G has no cycle of odd length G


    end vertices of every added chord have different colors.
    Graph Coloring

    For any graph 𝐺, 𝜒 𝐺 ≤ Δ G + 1 , Δ(G) is the maximum degree of any


    vertex.

    Consider any vertex v of G.

    The neighbours of v can have at most Δ(G) number of colors.

    Hence, along with one more color for v, the maximum number of colors that is
    required is Δ(G) + 1.

    This can be proved by induction also.

    Hence Δ(G) + 1 is an upper bound to the chromatic number of a graph G.

    You might also like

    pFad - Phonifier reborn

    Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

    Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


    Alternative Proxies:

    Alternative Proxy

    pFad Proxy

    pFad v3 Proxy

    pFad v4 Proxy