Existence of 4-factors in star-free graphs with edge-connectivity conditions

Yoshimi Egawa; Keiko Kotani; Jumpei Yamamoto

doi:10.1080/09728600.2023.2250407

AKCE International Journal of Graphs and Combinatorics (Jan 2024)

Existence of 4-factors in star-free graphs with edge-connectivity conditions

Yoshimi Egawa,
Keiko Kotani,
Jumpei Yamamoto

Affiliations

Yoshimi Egawa: Department of Applied Mathematics, Tokyo University of Science, Shinjuku-ku, Tokyo, Japan
Keiko Kotani: Department of Mathematics, Tokyo University of Science, Shinjuku-ku, Tokyo, Japan
Jumpei Yamamoto: Department of Applied Mathematics, Tokyo University of Science, Shinjuku-ku, Tokyo, Japan

DOI: https://doi.org/10.1080/09728600.2023.2250407
Journal volume & issue: Vol. 21, no. 1
pp. 41 – 47

Abstract

Read online

AbstractLet [Formula: see text] be an integer. We show that every 2-edge-connected [Formula: see text]-free graph with minimum degree at least [Formula: see text], as well as every 3-edge-connected [Formula: see text]-free graph with minimum degree at least [Formula: see text], has a 4-factor.

Published in AKCE International Journal of Graphs and Combinatorics

ISSN: 0972-8600 (Print); 2543-3474 (Online)
Publisher: Taylor & Francis Group
Country of publisher: United States
LCC subjects: Science: Mathematics
Website: https://www.tandfonline.com/journals/uakc

About the journal

Abstract

Keywords