Pages that link to "Item:Q5478021"
From MaRDI portal
The following pages link to Partitioning a graph into vertex-disjoint paths (Q5478021):
Displaying 10 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)
- 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)
- On degree sum conditions for directed path-factors with a specified number of paths (Q2005702) (← links)
- Spectral conditions for graphs to be \(k\)-Hamiltonian or \(k\)-path-coverable (Q2282471) (← links)
- Graphs with a path partition for structuring digital spaces (Q2446382) (← links)
