Factors and factorizations of graphs—a survey
From MaRDI portal
Publication:3714113
DOI10.1002/jgt.3190090103zbMath0587.05048OpenAlexW2048484904WikidataQ114236097 ScholiaQ114236097MaRDI QIDQ3714113
Publication date: 1985
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190090103
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (67)
On spanning trees with restricted degrees ⋮ Jin Akiyama: a friend and his mathematics (on the occasion of his 60th birthday) ⋮ An approximation algorithm for maximum \(P_{3}\)-packing in subcubic graphs ⋮ Generalized Latin squares. II ⋮ Some Results on Fractional Graph Theory ⋮ Claw-free graphs---a survey ⋮ Path factors of bipartite graphs ⋮ A short proof of Kundu's k-factor theorem ⋮ On toughness and \((g,f)\)-factors in bipartite graphs ⋮ A note on semi-coloring of graphs ⋮ Sufficient condition for the existence of an even \([a,b\)-factor in graph] ⋮ Graph factors and factorization: 1985--2003: a survey ⋮ \(P_3\)-factors in the square of a tree ⋮ Cut-edges and regular factors in regular graphs of odd degree ⋮ Randomly orthogonal factorizations with constraints in bipartite networks ⋮ Sufficient conditions for graphs to have \((g,f)\)-factors ⋮ Factorizations of the product of cycles ⋮ The \(k\)-strong induced arboricity of a graph ⋮ A characterization of graphs without even factors ⋮ On \((g,f)\)-factorizations of graphs ⋮ On the complexity landscape of connected \(f\)-factor problems ⋮ Zero-sum magic labelings and null sets of regular graphs ⋮ Simple reduction of f-colorings to edge-colorings ⋮ Packing 2- and 3-stars into cubic graphs ⋮ \(P_k\)-factors in squares and line graphs of trees ⋮ Three ways to cover a graph ⋮ The maximum 4-vertex-path packing of a cubic graph covers at least two-thirds of its vertices ⋮ Subdigraphs with orthogonal factorizations of digraphs ⋮ Randomly \(r\)-orthogonal factorizations in bipartite graphs ⋮ On caterpillar factors in graphs ⋮ Subdigraphs with orthogonal factorizations of digraphs. II ⋮ \(f\)-factors in bipartite (\(mf\))-graphs ⋮ Computing functions on asynchronous anonymous networks ⋮ A sufficient condition for a graph to have \([a,b\)-factors] ⋮ On specific factors in graphs ⋮ Maximum \((g,f)\)-factors of a general graph ⋮ Path-factors in the square of a tree ⋮ \(k\) -factors in regular graphs ⋮ \((r,r+1)\)-factorizations of \((d,d+1)\)-graphs ⋮ Degree-bounded factorizations of bipartite multigraphs and of pseudographs ⋮ \((g,f)\)-factors with special properties in bipartite \((mg,mf)\)-graphs ⋮ On 2-edge-connected \([\mathbf{a,b}\)-factors of graphs with Ore-type condition] ⋮ On maximum \(P_3\)-packing in claw-free subcubic graphs ⋮ \(G\)-designs and related designs ⋮ \(\{k,r-k\}\)-factors of \(r\)-regular graphs ⋮ Unnamed Item ⋮ On path factors of \((3,4)\)-biregular bigraphs ⋮ Tighter bounds on the size of a maximum \(P_{3}\)-matching in a cubic graph ⋮ \(C_ n\)-factors of group graphs ⋮ Some problems on factorizations with constraints in bipartite graphs ⋮ On the number of (r,r+1)- factors in an (r,r+1)-factorization of a simple graph ⋮ Regular factors of line graphs ⋮ Editing to Connected F-Degree Graph ⋮ Path factors in cubic graphs ⋮ Packing paths of length at least two ⋮ A note on edge-decompositions of planar graphs ⋮ Some results about component factors in graphs ⋮ Orthogonal factorizations of digraphs ⋮ A degree condition for the existence of 1-factors in graphs or their complements ⋮ Factors of Inserted Graphs ⋮ Decompositions to degree-constrained subgraphs are simply reducible to edge-colorings ⋮ On \((g,f)\)-uniform graphs ⋮ Sufficient conditions for a graph to have factors ⋮ Odd factors of a graph ⋮ The existence of path-factor covered graphs ⋮ Proof of a conjecture on the spectral radius condition for \([a,b\)-factors] ⋮ Factors of regular graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sufficient conditions for a graph to have factors
- 1-factors and polynomials
- Indestructive deletions of edges from graphs
- The number of 1-factors in 2k-connected graphs
- Perfect matchings of a graph
- [a,b-factorization of a graph]
- On the size of graphs with complete-factors
- On Factors of a Graph
- Paths, Trees, and Flowers
- Some Properties of Graphs with Multiple Edges
- Maximum matching and a polyhedron with 0,1-vertices
- The Factorization of Locally Finite Graphs
- The Factors of Graphs
- A Short Proof of the Factor Theorem for Finite Graphs
This page was built for publication: Factors and factorizations of graphs—a survey
