Partitioning a graph into vertex-disjoint paths

DOI10.1556/SSCMATH.42.2005.3.3zbMath1106.05052MaRDI QIDQ5478021

Jianping Li, George Steiner

Publication date: 2 January 2007

Published in: Studia Scientiarum Mathematicarum Hungarica (Search for Journal in Brave)

zbMATH Keywords

sufficient conditionsHamilton paths

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

Related Items (3)

Degree conditions for the existence of vertex-disjoint cycles and paths: a survey ⋮ 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

This page was built for publication: Partitioning a graph into vertex-disjoint paths