Jan Ekstein, Baoyindureng Wu, Liming Xiong
Published 2014-12-30Version 1
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.
Rainbow connection in $3$-connected graphs
Graphs with large generalized 3-connectivity
The asymptotic number of occurrences of a subtree in trees with bounded maximum degree and an application to the Estrada index
![QR code for arXiv:1412.8709 [math.CO]](http://oss.arxitics.com/images/favicon.svg)