Z3-connectivity with independent number 2
classification
🧮 math.CO
keywords
graphsindependentnumberedge-connectedeithergraphprovedthen
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.