Scribd Logo
Upload

Welcome to Scribd!

  • 43 views

    Graph Colouring Problem and Its Solution

    Uploaded by

    Sayan Mukherjee
    This document discusses the graph coloring problem and its solution. It begins by defining a graph and graph coloring as assigning colors to vertices such that no adjacent vertices have the same color. It then provides a brief history of the problem before explaining the graph coloring problem in more detail. It describes the chromatic number and different types of graph coloring problems like vertex coloring, edge coloring and face coloring problems. Finally, it provides examples of applications of graph coloring.

    Copyright:

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

    Graph Colouring Problem and Its Solution

    Uploaded by

    Sayan Mukherjee
    43 views10 pages
    This document discusses the graph coloring problem and its solution. It begins by defining a graph and graph coloring as assigning colors to vertices such that no adjacent vertices have the same color. It then provides a brief history of the problem before explaining the graph coloring problem in more detail. It describes the chromatic number and different types of graph coloring problems like vertex coloring, edge coloring and face coloring problems. Finally, it provides examples of applications of graph coloring.

    Original Description:

    Graph Colouring problem modern approach

    Original Title

    Graph Colouring Problem and its Solution

    Copyright

    © © All Rights Reserved

    Available Formats

    PPTX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document discusses the graph coloring problem and its solution. It begins by defining a graph and graph coloring as assigning colors to vertices such that no adjacent vertices have the same color. It then provides a brief history of the problem before explaining the graph coloring problem in more detail. It describes the chromatic number and different types of graph coloring problems like vertex coloring, edge coloring and face coloring problems. Finally, it provides examples of applications of graph coloring.

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd
    Download as pptx, pdf, or txt
    43 views10 pages

    Graph Colouring Problem and Its Solution

    Uploaded by

    Sayan Mukherjee
    This document discusses the graph coloring problem and its solution. It begins by defining a graph and graph coloring as assigning colors to vertices such that no adjacent vertices have the same color. It then provides a brief history of the problem before explaining the graph coloring problem in more detail. It describes the chromatic number and different types of graph coloring problems like vertex coloring, edge coloring and face coloring problems. Finally, it provides examples of applications of graph coloring.

    Copyright:

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

    Graph Colouring Problem

    and its Solution

    - PRESENTED BY SUBHAM
    MUKHERJEE
    Introduction

     A graph consists of a fi nite set of verti ces or nodes and a set of edges connecti ng these
    verti ces. Two verti ces are said to be adjacent if they are connected to each other by the same
    edge.

     Graph colouring is the procedure of assignment of colours to each vertex of a graph G such
    that no adjacent verti ces get same colour.

     The objecti ve is to minimize the number of colours while colouring a graph.


    History of Graph Colouring

     Gra p h c o lorin g o ri gin s m a y b e trac ed b a ck to


    18 52 .

     Au gu st u s de M o rga n in a l ett e r to h is frien d


    W illia m H am ilton a sk e d if it is p oss ible to
    co lo r t h e re gio n s of a n y m a p wit h fo u r co lo rs
    so th a t n ei gh b orin g reg io n s g e t d iffere n t
    co lo rs.

     Fra n cis G u th rie a s k ed if th i s wa s th e ca se fo r


    eve ry m a p a n d pu t t h e q u es tio n to h is brot h e r
    Fre de ri ck , a m a th e ma t ic s u n de rg ra du a te i n
    Ca m bridg e. I n 1 87 8 Ar th u r C a y l ey pre sen te d
    it to th e Lo n d on M a t h e ma t ica l So cie ty .
    Graph
    GraphColouring
    ColouringProblem
    Problem

    • Graph Coloring is a process of assigning


    colors to the vertices of a graph.

    • It ensures that no two adjacent vertices of


    the graph are colored with the same color.

    • Chromatic Number is the minimum number


    of colors required to properly color any
    graph.
    Types of Graph Colouring

    1. VERTEX COLOURING 2. EDGE COLOURING 3. FACE COLOURING


    Types of Vertex Graph Colouring

    M-COLOURABILITY DECISION PROBLEM M-COLOURABILITY OPTIMIZATION PROBLEM

     Given: Graph and a set of colors.  Given: graph

     Goal: Find out if the graph can be colored  Goal: fi nd out number of colors
    using the provided set of colors. required to color the graph .
    m-colourability decision problem

    HERE GIVEN 4 COLOURS. CAN WE COLOUR THIS


    GRAPH BY 4 COLOURS?

    Remember that:-
     No two adjacency vertex has same colour.
     We choose new colour until the colour end.
     We solve the problem using Backtracking method. It is a
    variant of Dynamic programming [intelligent Brute force SOLUTION:-
    technique] . The n- touple solution is={1,2,3,4,2}
    m-colourability optimization problem

    FIND THE MINIMUM VALUE OF M OF THE SAME


    GRAPH BY WHICH IT IS COLOURED PROPERLY.

    Remember that:-
     No two adjacency vertex has same colour.
     We solve the problem using Backtracking method. It is a
    SOLUTION:-
    variant of Dynamic programming[intelligent Brute force
    technique] The n-touple Solution is={1,2,3,4,2}. Value of m=4.
    Applications of Graph Colouring

    1. Making Schedule or Time Table


    2. Mobile Radio Frequency Assignment
    3. Sudoku
    4. Register Allocation
    5. Bipartite Graphs
    6. Map Colouring
    Thank You

    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