The following pages link to Path factors of bipartite graphs (Q4284102):
Displaying 14 items.
- Path-factors in the square of a tree (Q937248) (← 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)
- 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) (← links)
- Packing paths of length at least two (Q1827782) (← links)
- The existence of path-factor covered graphs (Q2107737) (← links)
- On path-factor critical deleted (or covered) graphs (Q2156074) (← links)
- The path partition problem and related problems in bipartite graphs (Q2465958) (← links)
- \(P_3\)-factors in the square of a tree (Q2657058) (← links)
- The maximum 4-vertex-path packing of a cubic graph covers at least two-thirds of its vertices (Q6144493) (← links)
- Path-factor critical covered graphs and path-factor uniform graphs (Q6186581) (← links)
- Path factors in bipartite graphs from size or spectral radius (Q6614061) (← links)
- Independence number and minimum degree for path-factor critical uniform graphs (Q6633529) (← links)
- Degree sum conditions for path-factor uniform graphs (Q6669307) (← links)
