Some sufficient conditions for graphs to have (g, f)-factors

DOI10.1017/S0004972700039368zbMath1144.05055OpenAlexW2117338875MaRDI QIDQ5297706

Si-zhong Zhou

Publication date: 12 July 2007

Published in: Bulletin of the Australian Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0004972700039368

zbMATH Keywords

\((g,f)\)-factorspanning subgraph

Mathematics Subject Classification ID

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

Related Items (3)

A sufficient condition for a graph to be an (a, b, k)-critical graph ⋮ On fractional \((f,n)\)-critical graphs ⋮ A NEIGHBOURHOOD CONDITION FOR GRAPHS TO BE FRACTIONAL (k, m)-DELETED GRAPHS

Cites Work

• Unnamed Item
• Connected \([a,b\)-factors in graphs]
• Fan-type results for the existence of [\(a\),\(b\)-factors]
• The dynamics of a prey-dependent consumption model concerning integrated pest management
• Subgraphs with prescribed valencies

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