Pages that link to "Item:Q3714113"
From MaRDI portal
The following pages link to Factors and factorizations of graphs—a survey (Q3714113):
Displaying 50 items.
- On spanning trees with restricted degrees (Q294729) (← links)
- A note on semi-coloring of graphs (Q354428) (← links)
- Sufficient condition for the existence of an even \([a,b]\)-factor in graph (Q354444) (← links)
- Zero-sum magic labelings and null sets of regular graphs (Q405209) (← links)
- Subdigraphs with orthogonal factorizations of digraphs (Q427789) (← links)
- \(\{k,r-k\}\)-factors of \(r\)-regular graphs (Q742594) (← links)
- Regular factors of line graphs (Q750467) (← links)
- Sufficient conditions for a graph to have factors (Q803162) (← links)
- An approximation algorithm for maximum \(P_{3}\)-packing in subcubic graphs (Q845730) (← links)
- On toughness and \((g,f)\)-factors in bipartite graphs (Q861483) (← links)
- Graph factors and factorization: 1985--2003: a survey (Q868347) (← links)
- A characterization of graphs without even factors (Q882784) (← links)
- Three ways to cover a graph (Q898135) (← links)
- Path-factors in the square of a tree (Q937248) (← links)
- \(k\) -factors in regular graphs (Q943560) (← links)
- Degree-bounded factorizations of bipartite multigraphs and of pseudographs (Q960926) (← links)
- On path factors of \((3,4)\)-biregular bigraphs (Q1014829) (← links)
- Tighter bounds on the size of a maximum \(P_{3}\)-matching in a cubic graph (Q1014835) (← links)
- Orthogonal factorizations of digraphs (Q1042545) (← links)
- Factors of regular graphs (Q1074601) (← links)
- A short proof of Kundu's k-factor theorem (Q1106246) (← links)
- A sufficient condition for a graph to have \([a,b]\)-factors (Q1173656) (← links)
- Maximum \((g,f)\)-factors of a general graph (Q1179272) (← links)
- \(C_ n\)-factors of group graphs (Q1263598) (← links)
- A degree condition for the existence of 1-factors in graphs or their complements (Q1301648) (← links)
- Decompositions to degree-constrained subgraphs are simply reducible to edge-colorings (Q1305535) (← links)
- Odd factors of a graph (Q1313354) (← links)
- Claw-free graphs---a survey (Q1356695) (← links)
- On \((g,f)\)-factorizations of graphs (Q1387478) (← links)
- \(f\)-factors in bipartite (\(mf\))-graphs (Q1421483) (← links)
- Randomly orthogonal factorizations with constraints in bipartite networks (Q1663915) (← links)
- \((g,f)\)-factors with special properties in bipartite \((mg,mf)\)-graphs (Q1764381) (← links)
- \(G\)-designs and related designs (Q1802138) (← links)
- Some problems on factorizations with constraints in bipartite graphs (Q1811123) (← links)
- Packing paths of length at least two (Q1827782) (← links)
- A note on edge-decompositions of planar graphs (Q1827795) (← links)
- Generalized Latin squares. II (Q1897439) (← links)
- Sufficient conditions for graphs to have \((g,f)\)-factors (Q1916381) (← links)
- On maximum \(P_3\)-packing in claw-free subcubic graphs (Q2025062) (← links)
- The existence of path-factor covered graphs (Q2107737) (← links)
- Proof of a conjecture on the spectral radius condition for \([a,b]\)-factors (Q2111929) (← links)
- Factorizations of the product of cycles (Q2176166) (← links)
- On caterpillar factors in graphs (Q2210502) (← links)
- On specific factors in graphs (Q2227979) (← links)
- Jin Akiyama: a friend and his mathematics (on the occasion of his 60th birthday) (Q2373936) (← links)
- The \(k\)-strong induced arboricity of a graph (Q2408964) (← links)
- On the complexity landscape of connected \(f\)-factor problems (Q2414869) (← links)
- Subdigraphs with orthogonal factorizations of digraphs. II (Q2441627) (← links)
- \((r,r+1)\)-factorizations of \((d,d+1)\)-graphs (Q2470430) (← links)
- On 2-edge-connected \([\mathbf{a,b}]\)-factors of graphs with Ore-type condition (Q2487985) (← links)
