Colouring of Graphs
Santosh Kumar Yadav · 2023
In graph theory, Graph colouring is a special case of graph labeling. It is an assignment of labels traditionally called “Colour’s” to elements of graph subject to certain constraint in. Its simplest form, it is a way of colouring the vertices of a graph such that no two adjacent vertices share the same colour, this is called vertex colouring. Similarly, an edge colouring assigns a colour to each edge so that no two adjacent edges share the same colour, and a face colouring of a planer graph assigns a colour to each face or region so that no two faces that share a boundary have the same colour.