独立点数为3的图的Z3-连通性

Z3-Connectivity of Graphs with Independence Number 3

  • 摘要: Jaeger猜想为“5-边连通图是Z3-连通的”, 此猜想对于独立点数为2的图是成立的。利用收缩、点分裂、反证等方法, 证明了此猜想对于独立点数为3且点连通度不大于5的图也是成立的。

     

    Abstract: Jaeger's Z3-connectivity conjecture is that every 5-edge-connected graph is Z3-connected, this conjecture is true for graphs with independence number 2. It is proved by contraction, vertex-splitting and contradiction methods that this conjecture holds for graphs with independence number 3 and connectivity less than 5.

     

/

返回文章
返回