Work

Fractional factors and component factors in graphs with isolated toughness smaller than 1

Year: 2024

Type: article

Abstract: Let be a simple graph and let be two integers with . We prove that for every if and only if has a ‐factor, where denotes the number of isolated vertices of and is a special family of trees. Furthermore, we characterize the trees in in terms of their bipartition.

Source: Journal of Graph Theory

DOI: 10.1002/jgt.23179

Author: Isaak H. Wolf

Institution: Paderborn University

Language: English

Topic: Advanced Graph Theory Research

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: hybrid

Estimated APC paid: $3,950

Funder: Deutsche Forschungsgemeinschaft