Improper colourings of graphs
We consider a generalisation of proper vertex colouring of graphs, referred to as improper colouring, in which each vertex can only be adjacent to a bounded number t of vertices with the same colour, and we study this type of graph colouring problem in several different settings. The thesis is divi...
मुख्य लेखक: | |
---|---|
अन्य लेखक: | |
स्वरूप: | थीसिस |
भाषा: | English |
प्रकाशित: |
2008
|
विषय: |