Partitions of a graph into paths with prescribed endvertices and lengths

DOI10.1002/1097-0118(200006)34:2%3C163::AID-JGT5%3E3.0.CO;2-KMaRDI QIDQ4489491zbMATH OpenOpenAlexFDO

Authors Hikoe Enomoto, Katsuhiro Ota

Publication date 20 September 2000

Full work available at URL https://doi.org/10.1002/1097-0118(200006)34:2%3C163::aid-jgt5%3E3.0.co;2-k

zbMATH Keywords

partitionspaths

Mathematics Subject Classification ID

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

Recommendations

• Graph partition into paths containing specified vertices
• Enomoto and Ota's conjecture holds for large graphs
• Partitioning graphs into paths or cycles of prescribed lengths
• An asymptotic version of a conjecture by Enomoto and Ota
• Partitioning a graph into vertex-disjoint paths

Cites work

• A homology theory for spanning tress of a graph
• An El-Zah�r type condition ensuring path-factors
• Graph decompositions without isolated vertices
• Graph decompositions without isolated vertices III
• Note on Hamilton Circuits
• On circuits in graphs

Cited in

(14)

• Degree sum conditions for path-factors with specified end vertices in bipartite graphs
• Graph partition into paths containing specified vertices
• Paired 2-disjoint path covers of burnt pancake graphs with faulty elements
• Graph decompositions and \(D_3\)-paths with a prescribed endvertex
• Partitioning graphs into paths or cycles of prescribed lengths
• Path partitions of hypercubes
• Note on semi-linkage with almost prescribed lengths in large graphs
• Note on Enomoto and Ota's conjecture for short paths in large graphs
• Enomoto and Ota's conjecture holds for large graphs
• Degree conditions for the existence of vertex-disjoint cycles and paths: a survey
• Partitioning a graph into vertex-disjoint paths
• On partitioning the edge set of a graph into internally disjoint paths without exterior vertices
• An asymptotic version of a conjecture by Enomoto and Ota
• On the path partition of graphs

This page was built for publication: Partitions of a graph into paths with prescribed endvertices and lengths

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