Z3-connectivity with independent number 2
Combinatorics
2014-11-25 v1
Abstract
Let G be a 3-edge-connected graph on n vertices. It is proved in this paper that if the number of independent set no more than 2, then either G can be Z3-contracted to one of graphs {K1;K4} or G is one of the graphs in Fig. 1.
Keywords
Cite
@article{arxiv.1411.6401,
title = {Z3-connectivity with independent number 2},
author = {Fan Yang and Xiangwen Li and Liangchen Li},
journal= {arXiv preprint arXiv:1411.6401},
year = {2014}
}
Comments
11 pages,3 figures