Z3-connectivity with independent number 2
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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.