A characterization of graphs having all \((g,f)\)-factors
From MaRDI portal
Publication:1366610
DOI10.1006/jctb.1997.1797zbMath0888.05048OpenAlexW2012934650MaRDI QIDQ1366610
Publication date: 15 September 1997
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jctb.1997.1797
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)
Related Items
Independence number, connectivity and all fractional \((a, b, k)\)-critical graphs, Solution to a forcible version of a graphic sequence problem, Sufficient conditions for a graph to have all \([a, b\)-factors and \((a, b)\)-parity factors], Graph factors and factorization: 1985--2003: a survey, A characterization of box-bounded degree sequences of graphs, Existence of all generalized fractional \((g, f)\)-factors of graphs, On the complexity of all \(( g , f )\)-factors problem, Simplified existence theorems on all fractional \([a,b\)-factors], A Note on the Existence of All (g,f)-Factors, On all fractional \({(a,b,k)}\)-critical graphs, Some existence theorems on all fractional \((g,f)\)-factors with prescribed properties, Orthogonal (g, f)-factorizations in networks, Characterizations of graphs \(G\) having all \([1, k\)-factors in \(k G\)], On \((g,f)\)-uniform graphs, \((g, f)\)-factorizations randomly orthogonal to a subgraph in graphs, Randomly orthogonal \((g,f)\)-factorizations in graphs, A Tutte-Type Characterization for Graph Factors
Cites Work
