摘要
Let G be a graph. For any vertex v ∈ V(G) and any function [Formula presented], denote by Jf(v) the set consisting of the integer f(v) and all positive odd integers less than f(v), and by Jfo(v) the set of positive odd integers no greater than f(v) + 1. In this paper, we show that a graph G satisfies the Tutte-type condition [Formula presented] for any nonempty set S ⊂ V(G), v∈S if and only if G contains an H-factor for any H ∈ H, where [Formula presented] for each v ∈ V(G)}. This is a new characterization on the open problem proposed by Akiyama and Kano (2011). Moreover, we also characterize toughness conditions in terms of graph factors.
| 投稿的翻译标题 | Characterization of the Tutte-type condition and graph factors |
|---|---|
| 源语言 | 繁体中文 |
| 页(从-至) | 1821-1828 |
| 页数 | 8 |
| 期刊 | Scientia Sinica Mathematica |
| 卷 | 54 |
| 期 | 11 |
| DOI | |
| 出版状态 | 已出版 - 2024 |
关键词
- Tutte-condition
- degree constrained factor
- toughness
指纹
探究 'Tutte 类型条件刻画与图因子' 的科研主题。它们共同构成独一无二的指纹。引用此
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver