Connected even factors in the square of essentially 2-edge connected graphs
Combinatorics
2017-09-19 v3
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.
Keywords
Cite
@article{arxiv.1412.8709,
title = {Connected even factors in the square of essentially 2-edge connected graphs},
author = {Jan Ekstein and Baoyindureng Wu and Liming Xiong},
journal= {arXiv preprint arXiv:1412.8709},
year = {2017}
}
Comments
11 pages