The following pages link to (Q5310215):
Displaying 5 items.
- On partitioning the edge set of a graph into internally disjoint paths without exterior vertices (Q659668) (← links)
- On partitioning simple bipartite graphs in vertex-disjoint paths (Q925494) (← links)
- Splitting a graph into disjoint induced paths or cycles. (Q1408827) (← links)
- Degree conditions for the existence of vertex-disjoint cycles and paths: a survey (Q1706420) (← links)
- On the path partition of graphs (Q6137690) (← links)