A Tutte-type characterization for graph factors

preprint2015arXivOpen access

Abstract

Let GG be a connected general graph. Let f ⁣:V(G)→Z+f\colon V(G)\to \Z^+ be a function. We show that GG satisfies the Tutte-type condition o(G−S)≤f(S)for all vertex subsets S, o(G-S)\le f(S)\qquad\text{for all vertex subsets $S$}, if and only if it contains a colored Jf∗J_f^*-factor for any 22-end-coloring, where Jf∗(v)J_f^*(v) is the union of all odd integers smaller than f(v)f(v) and the integer f(v)f(v) itself. This is a generalization of the (1,f)(1,f)-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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.