UVicSpace

Browsing ETD (Electronic Theses and Dissertations) by Subject "(k,l)-colouring"

Browsing ETD (Electronic Theses and Dissertations) by Subject "(k,l)-colouring"

Sort by: Order: Results:

  • Epple, Dennis D. A. (2011-08-29)
    A (k,l)-colouring of a graph is a partition of its vertex set into k independent sets and l cliques. The bichromatic number chi^b of a graph is the minimum r$ such that the graph is (k,l)-colourable for all k+l=r. The ...

Search UVicSpace


Browse

My Account

Help