The following pages link to On the path partition of graphs (Q6137690):
Displaying 18 items.
- On partitioning the edge set of a graph into internally disjoint paths without exterior vertices (Q659668) (← links)
- The path partition conjecture is true for claw-free graphs (Q878616) (← links)
- On partitioning simple bipartite graphs in vertex-disjoint paths (Q925494) (← links)
- Path partitions and packs of acyclic digraphs (Q1061135) (← links)
- Partitions of digraphs into paths or circuits (Q1084110) (← links)
- Conditions for graphs to be path partition optimal (Q1709536) (← links)
- A fast randomized algorithm for partitioning a graph into paths of fixed length (Q1803681) (← links)
- Partitioning graphs into paths or cycles of prescribed lengths (Q1937351) (← links)
- Graphs with a path partition for structuring digital spaces (Q2446382) (← links)
- Path partitions of almost regular graphs (Q2800782) (← links)
- A survey of the path partition conjecture (Q2866454) (← links)
- Path Partitions, Cycle Covers and Integer Decomposition (Q3655152) (← links)
- (Q4547805) (← links)
- (Q4664110) (← links)
- Path partitions and forward-only trellis algorithms (Q4679878) (← links)
- On path partitions of the divisor graph (Q5220097) (← links)
- The Path Partition Conjecture (Q5378302) (← links)
- On the path partition number of 6‐regular graphs (Q6057632) (← links)
