Colouring of Graphs

Santosh Kumar Yadav ()
Additional contact information
Santosh Kumar Yadav: Shri Jagdishprasad Jhabarmal Tibrewala University

Chapter Chapter 15 in Discrete Mathematics with Graph Theory, 2023, pp 609-639 from Springer

Abstract: Abstract 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.

Date: 2023
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-031-21321-2_15

Ordering information: This item can be ordered from
http://www.springer.com/9783031213212

DOI: 10.1007/978-3-031-21321-2_15

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().