On partitioning the edge set of a graph into internally disjoint paths without exterior vertices

DOI10.1007/s00373-010-0963-4zbMath1235.05115OpenAlexW2023568859MaRDI QIDQ659668

G. R. Vijayakumar

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

zbMATH Keywords

envelope\(\theta \)-pack\(\theta \)-ringpath pilepath piling number

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Graphoidal covers and graphoidal covering number of a graph
• The graphoidal covering number of unicyclic graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On partitioning the edge set of a graph into internally disjoint paths without exterior vertices