New type degree conditions for a graph to have a 2-factor
Discrete Mathematics · 2026-10 · 349 (10) · 115218
DOI: 10.1016/j.disc.2026.115218 ↗Kurz gefasst
Fachartikel in der Zeitschrift Discrete Mathematics, 2026-10. Verfasst von Masaki Kashima. Die Arbeit nennt 13 Literaturangaben. Gefördert von: Japan Society for the Promotion of Science.
Abstract (Originalsprache)
A 2-factor of a graph is a 2-regular spanning subgraph. For a graph $G$ and an independent set $I$ of $G$, let $\delta_G(I)$ denote the minimum degree of vertices contained in $I$. We show that (1) if every independent set $I$ of $G$ satisfies $|I|\leq \delta_G(I)-1$, then $G$ has a 2-factor and that (2) if every independent set $I$ of $G$ satisfies $|I|\leq \delta_G(I)$, then $G$ has a 2-factor unless $G$ is isomorphic to a graph in completely determined exceptional graphs. It can be easily shown that the assumption of (1) is a relaxation of the Dirac condition on Hamiltonicity of graphs, and that the assumption of (2) is a relaxation of the Chv\'{a}tal-Erd\H{o}s condition on Hamiltonicity of graphs. Furthermore, for graphs with the assumption of (1), we show some results on a 2-factor with a bounded number of cycles.
Förderung
- Japan Society for the Promotion of Science
Zitieren
APA
Kashima, M. (2026). New type degree conditions for a graph to have a 2-factor. Discrete Mathematics, 349(10), 115218. https://doi.org/10.1016/j.disc.2026.115218
Vancouver
Kashima M. New type degree conditions for a graph to have a 2-factor. Discrete Mathematics. 2026;349(10):115218. doi:10.1016/j.disc.2026.115218
BibTeX
@article{Kashima2026,
author = {Kashima, Masaki},
title = {New type degree conditions for a graph to have a 2-factor},
journal = {Discrete Mathematics},
year = {2026},
volume = {349},
number = {10},
pages = {115218},
doi = {10.1016/j.disc.2026.115218}
}
EUVIMED