A degree condition for the existence of \([a,b]\)-factors in \(K_{1,n}\)-free graphs

DOI10.3836/TJM/1270041821zbMath0916.05058OpenAlexW2058223880MaRDI QIDQ1281860

Taro Tokuda

Publication date: 19 July 1999

Published in: Tokyo Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3836/tjm/1270041821

zbMATH Keywords

minimum degreefactordegree condition

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (1)

Graph factors and factorization: 1985--2003: a survey

This page was built for publication: A degree condition for the existence of \([a,b]\)-factors in \(K_{1,n}\)-free graphs