Connected factors in \(K_{1,n}\)-free graphs containing a \((g,f)\)-factor

zbMath0910.05051MaRDI QIDQ1272538

Taro Tokuda, Zhenhong Liu, Bao-guang Xu

Publication date: 9 April 1999

Published in: Graphs and Combinatorics (Search for Journal in Brave)

zbMATH Keywords

claw-free graphconnected factor\(K_{1,n}\)-free graph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items

Spanning trees and spanning closed walks with small degrees, Graph factors and factorization: 1985--2003: a survey, Binding numbers and connected factors, Connected factors in \(K_{1,n}\)-free graphs containing an \([a,b\)-factor], On \((g,f)\)-uniform graphs, \((g, f)\)-factorizations randomly orthogonal to a subgraph in graphs, Randomly orthogonal \((g,f)\)-factorizations in graphs