Sufficient conditions for graphs to have \((g,f)\)-factors

DOI10.1016/0012-365X(94)00085-WzbMath0853.05061MaRDI QIDQ1916381

Yoshimi Egawa, Mikio Kano

Publication date: 9 December 1996

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

zbMATH Keywords

\((g,f)\)-factor

Mathematics Subject Classification ID

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

Related Items (12)

Discussions on orthogonal factorizations in digraphs ⋮ The existence of subdigraphs with orthogonal factorizations in digraphs ⋮ A degree condition for fractional \((g, f, n)\)-critical covered graphs ⋮ Equitable factorizations of edge-connected graphs ⋮ An existence theorem on fractional ID-(g, f)-factor-critical covered graphs ⋮ Graph factors and factorization: 1985--2003: a survey ⋮ Factors with red-blue coloring of claw-free graphs and cubic graphs ⋮ Toughness for fractional \((2, b, k)\)-critical covered graphs ⋮ Degree factors with red-blue coloring of regular graphs ⋮ Research on fractional critical covered graphs ⋮ Factors in graphs with odd-cycle property ⋮ \(\{k,r-k\}\)-factors of \(r\)-regular graphs

Cites Work

• [a,b-factors of graphs]
• Factors and factorizations of graphs—a survey
• Factors of Locally almost Regular Graphs
• The Subgraph Problem
• Subgraphs with prescribed valencies

This page was built for publication: Sufficient conditions for graphs to have \((g,f)\)-factors