Some sufficient conditions for graphs to have (g, f)-factors
From MaRDI portal
Publication:5297706
DOI10.1017/S0004972700039368zbMath1144.05055MaRDI QIDQ5297706
Publication date: 12 July 2007
Published in: Bulletin of the Australian Mathematical Society (Search for Journal in Brave)
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
Related Items
On fractional \((f,n)\)-critical graphs, A sufficient condition for a graph to be an (a, b, k)-critical graph, A NEIGHBOURHOOD CONDITION FOR GRAPHS TO BE FRACTIONAL (k, m)-DELETED GRAPHS
Cites Work