Pages that link to "Item:Q3714113"

The following pages link to Factors and factorizations of graphs—a survey (Q3714113):

Displaying 34 items.

• 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)
• On \((g,f)\)-uniform graphs (Q2577646) (← links)
• \(P_3\)-factors in the square of a tree (Q2657058) (← links)
• Cut-edges and regular factors in regular graphs of odd degree (Q2657077) (← links)
• Randomly \(r\)-orthogonal factorizations in bipartite graphs (Q2699238) (← links)
• Factors and factorization of graphs (Q2767377) (← links)
• Degree sets and graph factorizations (Q3347921) (← links)
• (Q3428492) (← links)
• Factors of Inserted Graphs (Q3429757) (← links)
• On the number of (<i>r,r</i>+1)- factors in an (<i>r,r</i>+1)-factorization of a simple graph (Q3633008) (← links)
• Path factors in cubic graphs (Q3651178) (← links)
• [<i>a,b</i>]‐factorizations of graphs (Q3978370) (← links)
• (Q4027207) (← links)
• Path factors of bipartite graphs (Q4284102) (← links)
• (Q4820527) (← links)
• Computing functions on asynchronous anonymous networks (Q4887486) (← links)
• 2- and 3-factors of graphs on surfaces (Q5199420) (← links)
• Editing to Connected F-Degree Graph (Q5232130) (← links)
• Some results about component factors in graphs (Q5242258) (← links)
• Some Results on Fractional Graph Theory (Q5302745) (← links)
• (Q5374247) (← links)
• (Q5852312) (← links)
• Factorizations of and by powers of complete graphs (Q5957708) (← links)
• Simple reduction of f-colorings to edge-colorings (Q6085710) (← links)
• Packing 2- and 3-stars into cubic graphs (Q6095048) (← links)
• \(P_k\)-factors in squares and line graphs of trees (Q6096380) (← links)
• The maximum 4-vertex-path packing of a cubic graph covers at least two-thirds of its vertices (Q6144493) (← links)
• Packing 2- and 3-stars into \(( 2 , 3 )\)-regular graphs (Q6657246) (← links)
• Degree conditions for path-factors in graphs (Q6658903) (← links)
• Degree sum conditions for path-factor uniform graphs (Q6669307) (← links)