关于路核和路剖分的研讨.pdfVIP

℄ G τ (G). V (G) S G P - τ (G[S]) ≤ n − 1 V (G) − S n v G[S] n − 1 V (G) A,B τ (G[S]) ≤ a τ (G[S]) ≤ b, G (a,b) - n 3g − 1 g 2 Pn+1 - τ (G) = a + b 1 ≤ a ≤ b, G g 2 (a + 1) , ℄ G (a,b) - 3  (a,b) -  i ON PATH KERNELS AND PARTITIONS ABSTRACT The detour order of a graph G, denoted by τ (G), is the order of a longest path in G. A subset S of V (G) is called a P -kernel of G if τ (G[S]) ≤ n − 1 n and every vertex v ∈ V (G) − S is adjacent to an end-vertex of a path of order n − 1 in G[S]. A partition of the vertex set of G into two sets, A and B, such that τ (G[A]) ≤ a and τ (G[B]) ≤ b is called an (a,b)-partition of G. In this paper we show that any graph with girth g has a Pn+1-kernel for every n 3g − 1. Furthermore, if τ (G) = a + b, 1 ≤ a ≤ b, G has girth 2 g 2 (a + 1), then G has an (a,b)-partition. 3 KEY WORDS: path kernel, path semikernel, (a,b)-partition, Path Par- tition Conjecture. ii G + H D = (V,A) τ (G) G ∪ NG (v) G v ∩ Pn n ⊆ g (G) G ⊂ \ △ V (G) G v(G) G E (G) G ǫ(G) G ′ ′ G[V ] V ′ ′