一类毛毛虫的哈密顿染色.pdfVIP

n G c Æ G u v |c(u) −c(v)|+ D(u,v) ≥ n − 1 D(u, v) G u − v hc(c) G c ℄Æ G hc(G) hc(c) c G – i  HAMILTONIAN COLORINGS OF SOME CTERPILLARS ABSTRACT A hamiltonian coloring of a connected graph G of order n is an as- signment c of colors (positive integers) to the vertices of G, such that |c(u) − c(v)| + D(u,v) ≥ n − 1 for every two distinct