Report copyright - Near-colorings: non-colorable graphs and NP-completenessochem/MO13-v9.pdf · l such that the graph G[V i] induced by the vertices of V i has maximum degree at most d i for all 1 6
Please pass captcha verification before submit form