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

DOI10.1007/S00373-010-0963-4MaRDI QIDQ659668zbMATH OpenOpenAlexFDO

Authors 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

\(\theta \)-pack\(\theta \)-ringenvelopepath pilepath piling number

Mathematics Subject Classification ID

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

Recommendations

• Partitions of the edge set of a graph into internally disjoint paths
• Partitioning a graph into vertex-disjoint paths
• Edge-partitioning a graph into paths: beyond the Barát-Thomassen conjecture
• On partitioning simple bipartite graphs in vertex-disjoint paths
• On the path partition of graphs
• On partitioning the edges of graphs into connected subgraphs
• Partitioning a bipartite graph into vertex-disjoint paths.
• Partitions of a graph into paths with prescribed endvertices and lengths
• scientific article; zbMATH DE number 3825881
• Edge-disjoint paths revisited

Cites work

• Graphoidal covers and graphoidal covering number of a graph
• Graphs with unique minimum simple acyclic graphoidal cover
• scientific article; zbMATH DE number 1432797 (Why is no real title available?)
• scientific article; zbMATH DE number 2192125 (Why is no real title available?)
• scientific article; zbMATH DE number 2229025 (Why is no real title available?)
• Partitions of the edge set of a graph into internally disjoint paths
• Simple acyclic graphoidal covers in a graph
• The graphoidal covering number of unicyclic graphs

Cited in

(2)

• Interior vertices in set partitions
• Partitions of the edge set of a graph into internally disjoint paths

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q659668)