A Tutte-type characterization for graph factors

Hongliang Lu, David G.L. Wang*

*此作品的通讯作者

科研成果: 期刊稿件文章同行评审

3 引用 (Scopus)

摘要

Let G be a connected general graph. For any vertex v ∈ V (G) and any function f : V(G) → Z+, we introduce a set J∗f (v) consisting of the integer f(v) and all odd integers less than f(v), including all negative odd integers. In this paper, we shows that the graph G satisfies the general Tutte-type condition o(G - S) ≤ ∑v∈S f(v) for any nonempty set S ⊃ V (G) if and only if either G has a colored J∗f-factor for any 2-end-coloring, or G is of odd order and is J∗f-critical for any 2-end-coloring. This characterization solves a problem posed by Akiyama and Kano, as well as a problem of Cui and Kano's.

源语言英语
页(从-至)1149-1159
页数11
期刊SIAM Journal on Discrete Mathematics
31
2
DOI
出版状态已出版 - 2017

指纹

探究 'A Tutte-type characterization for graph factors' 的科研主题。它们共同构成独一无二的指纹。

引用此