Toughness and \((g,f)\)-factors in graphs with prescribed properties
Ars Combinatoria · 17.06.2026 · 167 · 125-133
DOI: 10.61091/ars167-08 ↗Kurz gefasst
Fachartikel in der Zeitschrift Ars Combinatoria, online erschienen am 17.06.2026. Verfasst von Renying Chang.
Abstract (Originalsprache)
In this paper, we consider the relationship between toughness and the existence of \((g,f)\)-factors with inclusion/exclusion properties. We obtain that if \(t(G) \geq \frac{(a+b)^{2}+2(b-a)-3}{4(a+1)}\) with \(b > a \geq 2\) and \(a \leq g(x) < f(x) \leq b\) where \(a\), \(b\) are two integers, then for any two given edges \(e_{1}\) and \(e_{2}\), there exists a \((g,f)\)-factor including \(e_{1}\), \(e_{2}\); and a \((g,f)\)-factor including \(e_{1}\) and excluding \(e_{2}\); as well as a \((g,f)\)-factor excluding \(e_{1}\), \(e_{2}\).
Zitieren
APA
Chang, R. (2026). Toughness and \((g,f)\)-factors in graphs with prescribed properties. Ars Combinatoria, 167, 125-133. https://doi.org/10.61091/ars167-08
Vancouver
Chang R. Toughness and \((g,f)\)-factors in graphs with prescribed properties. Ars Combinatoria. 2026;167:125-133. doi:10.61091/ars167-08
BibTeX
@article{Chang2026,
author = {Chang, Renying},
title = {Toughness and \((g,f)\)-factors in graphs with prescribed properties},
journal = {Ars Combinatoria},
year = {2026},
volume = {167},
pages = {125--133},
doi = {10.61091/ars167-08}
}
EUVIMED