On Cui-Kano's Characterization Problem on Graph Factors

DOI10.1002/jgt.21712zbMath1276.05093arXiv1109.4863OpenAlexW2147615490MaRDI 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\)-factorLovász's structural description

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)

Related Items (6)

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

This page was built for publication: On Cui-Kano's Characterization Problem on Graph Factors