Partitioning a graph into vertex-disjoint paths
From MaRDI portal
Recommendations
Cited in
(17)- Splitting a graph into disjoint induced paths or cycles.
- Degree conditions for the existence of vertex-disjoint cycles and paths: a survey
- Conditions for graphs to be path partition optimal
- A fast randomized algorithm for partitioning a graph into paths of fixed length
- Partitioning graphs into paths or cycles of prescribed lengths
- On degree sum conditions for directed path-factors with a specified number of paths
- Spectral conditions for graphs to be \(k\)-Hamiltonian or \(k\)-path-coverable
- Graphs with a path partition for structuring digital spaces
- An asymptotic version of a conjecture by Enomoto and Ota
- Necessary Condition for Path Partitioning Constraints
- A path(ological) partition problem
- Partitions of a graph into paths with prescribed endvertices and lengths
- Partitioning a bipartite graph into vertex-disjoint paths.
- Partitions of the edge set of a graph into internally disjoint paths
- scientific article; zbMATH DE number 2188351 (Why is no real title available?)
- On partitioning the edge set of a graph into internally disjoint paths without exterior vertices
- On partitioning simple bipartite graphs in vertex-disjoint paths
This page was built for publication: Partitioning a graph into vertex-disjoint paths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5478021)
