A Tutte-type characterization for graph factors
Combinatorics
2015-12-17 v1
Abstract
Let be a connected general graph. Let be a function. We show that satisfies the Tutte-type condition if and only if it contains a colored -factor for any -end-coloring, where is the union of all odd integers smaller than and the integer itself. This is a generalization of the -odd factor characterization theorem, and answers a problem of Cui and Kano. We also derive an analogous characterization for graphs of odd orders, which addresses a problem of Akiyama and Kano.
Keywords
Cite
@article{arxiv.1512.05182,
title = {A Tutte-type characterization for graph factors},
author = {Hongliang Lu and David G. L. Wang},
journal= {arXiv preprint arXiv:1512.05182},
year = {2015}
}
Comments
12 pages