Browsing by Subject "k-colourable graph"

Please be advised that the site will be down for maintenance on Sunday, September 1, 2024, from 08:00 to 18:00, and again on Monday, September 2, 2024, from 08:00 to 09:00. We apologize for any inconvenience this may cause.

Browsing by Subject "k-colourable graph"

Sort by: Order: Results:

  • Universal H-colourable graphs 
    Broere, Izak; Heidema, Johannes (Springer, 2013)
    Rado constructed a (simple) denumerable graph R with the positive integers as vertex set with the following edges: for given m and n with m < n, m is adjacent to n if n has a 1 in the mth position of its binary expansion. ...