Decomposing C4‐free graphs under degree constraints
Work
Year: 2018
Type: article
Abstract: A celebrated theorem of Stiebitz 13 asserts that any graph with minimum degree at least can be partitioned into two parts that induce two subgraphs with minimum degree at least s and t , respectively... more
Source: Journal of Graph Theory
Authors Jie Ma, Tianchi Yang
Institution University of Science and Technology of China
Cites: 17
Cited by: 15
Related to: 10
FWCI: 2.822
Citation percentile (by year/subfield): 87.67
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: bronze
Grant IDS 11622110, 11501539