A Tutte-Type Characterization for Graph Factors

DOI10.1137/16M1079609zbMath1365.05233arXiv1512.05182MaRDI QIDQ5267996

Hongliang Lu, David G. L. Wang

Publication date: 14 June 2017

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

perfect matchinggraph factorantifactordegree prescribed subgraph problem

Mathematics Subject Classification ID

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

Related Items (2)

Characterization of 1-tough graphs using factors ⋮ A characterization for graphs having strong parity factors

Cites Work

• Unnamed Item
• Factors and factorizations of graphs. Proof techniques in factor theory
• Good characterizations for some degree constrained subgraphs
• On factors with all degrees odd
• General factors of graphs
• General antifactors of graphs
• A characterization of graphs having all \((g,f)\)-factors
• On Cui-Kano's Characterization Problem on Graph Factors
• Some results on odd factors of graphs
• The factorization of graphs. II
• \((1,f)\)-factors of graphs with odd property

This page was built for publication: A Tutte-Type Characterization for Graph Factors