2-连通(K_(1,4);2)-的最长圈

本文证明了2 连通(K1,4;2) 图,当δ≥3时最长圈的长至少为min{n,2δ+2}.

(K_(1,4);2)图的最小walk(英文)

考虑一种包含无爪图的图类 (K1,4 ;2 ) 图 ,给出了关于walk的几个结果 ,特别是关于过给定点恰好一次的最小coveringwalk .

{K_(1,4),K_(1,4)+e}-free图Hamilton性的邻集交条件

设G是阶为n(n≥3)的2一连通{K_(1,4),K_(1,4)+e}-free图,连通度为k,给出了{K_(1,4),K_(1,4)+e}图的Hamilton性的邻集交条件,即如果对于每一个k+1个点的独立集S,存在u,v∈S,有|N(u)∩N(v)|≥max{n-k-2/4,2},则G是Hamilton图.

Note on the Longest Paths in {K_(1,4),K_(1,4)+e}-free Graphs

A graph G is{K_(1,4),K_(1,4)+e}-free if G contains no induced subgraph isomorphic to K_(1,4) or KI,a+e In this paper,we show that G has a path which is either hamiltonian or of length at least 25(G)+2 if G is a connected{K_(1,4),K_(1,4)+e}-free graph on at least 7 vertices.

图的禁用子图与H-连通性

证明了4-连通的K1,4受限{I, Z,P5,Z2}-free或{A,P5,Q,Z2}-free图是H 连通的.