Connected even factors in the square of essentially 2-edge connected graphs
classification
🧮 math.CO
keywords
connectededgeessentiallyevensquaredegreefactorgraph
read the original abstract
In this paper we prove that the square of an essentially 2-edge connected graph with an additional property has a connected even factor with maximum degree at most 4. Moreover we show that, in general, the square of essentially 2-edge connected graph does not contain a connected even factor with bounded maximum degree.
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.