On Cui-Kano's Characterization Problem on Graph Factors

DOI10.1002/jgt.21712zbMath1276.05093arXiv1109.4863MaRDI QIDQ2862548

Hongliang Lu, David G. L. Wang

Publication date: 15 November 2013

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1109.4863

zbMATH Keywords

\(H_n\)-decomposition; \(H_n\)-factor; Lovász's structural description

Mathematics Subject Classification ID

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

05C75: Structural characterization of families of graphs

Related Items

An existence theorem on Hamiltonian (g,f)-factors in networks, A Tutte-Type Characterization for Graph Factors, \((1,f)\)-factors of graphs with odd property, Isolated toughness and \(k\)-Hamiltonian \([a,b\)-factors], Strong Tutte type conditions and factors of graphs, An Extension of Cui-Kano's Characterization on Graph Factors

Cites Work

• Unnamed Item
• Unnamed Item
• Factors and factorizations of graphs. Proof techniques in factor theory
• Graph factors and factorization: 1985--2003: a survey
• Elementary graphs with respect to \(f\)-parity factors
• On factors with all degrees odd
• General factors of graphs
• An extension of Tutte's 1-factor theorem
• Odd factors of a graph
• Connected factors in graphs -- a survey
• Graph Factors and Matching Extensions
• Some results on odd factors of graphs
• The factorization of graphs. II