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

DOI10.1007/S00373-010-0963-4zbMATH Open1235.05115OpenAlexW2023568859MaRDI QIDQ659668FDOQ659668

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

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

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

• Title not available (Why is that?)
• Title not available (Why is that?)
• Graphoidal covers and graphoidal covering number of a graph
• The graphoidal covering number of unicyclic graphs
• Graphs with unique minimum simple acyclic graphoidal cover
• Simple acyclic graphoidal covers in a graph
• Partitions of the edge set of a graph into internally disjoint paths
• Title not available (Why is that?)

Cited In (2)

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

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)