On partitioning the edge set of a graph into internally disjoint paths without exterior vertices
From MaRDI portal
Publication:659668
DOI10.1007/s00373-010-0963-4zbMath1235.05115OpenAlexW2023568859MaRDI QIDQ659668
Publication date: 24 January 2012
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-010-0963-4
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
This page was built for publication: On partitioning the edge set of a graph into internally disjoint paths without exterior vertices