Pages that link to "Item:Q1400955"

The following pages link to A necessary and sufficient condition for the existence of a path factor every component of which is a path of length at least two (Q1400955):

Displayed 13 items.

• Packing 3-vertex paths in claw-free graphs and related topics (Q617645) ‎ (← links)
• Graph factors and factorization: 1985--2003: a survey (Q868347) ‎ (← links)
• Path-factors in the square of a tree (Q937248) ‎ (← links)
• Component factors with large components in graphs (Q963816) ‎ (← links)
• Path factors and parallel knock-out schemes of almost claw-free graphs (Q968408) ‎ (← links)
• On path factors of \((3,4)\)-biregular bigraphs (Q1014829) ‎ (← links)
• Packing trees with constraints on the leaf degree (Q1014830) ‎ (← links)
• Characterizations for \({\mathcal{P}}_{\geq 2}\)-factor and \({\mathcal{P}}_{\geq 3}\)-factor covered graphs (Q1025460) ‎ (← links)
• Packing paths of length at least two (Q1827782) ‎ (← links)
• The path partition problem and related problems in bipartite graphs (Q2465958) ‎ (← links)
• Packingk-edge trees in graphs of restricted vertex degrees (Q3594953) ‎ (← links)
• Path factors in cubic graphs (Q3651178) ‎ (← links)
• (Q5708503) ‎ (← links)