Graph partition into paths containing specified vertices

DOI10.1016/S0012-365X(01)00349-1MaRDI QIDQ1598832zbMATH OpenOpenAlexFDO

Authors Ken-ichi Kawarabayashi

Publication date 28 May 2002

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0012-365x(01)00349-1

zbMATH Keywords

graph partitionpaths containing specified vertices

Mathematics Subject Classification ID

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

Recommendations

• Partitions of a graph into paths with prescribed endvertices and lengths
• Graph decompositions without isolated vertices. II
• Partitioning graphs into paths or cycles of prescribed lengths
• scientific article; zbMATH DE number 2101287
• Enomoto and Ota's conjecture holds for large graphs

Cited in

(7)

• Partitions of a graph into paths with prescribed endvertices and lengths
• scientific article; zbMATH DE number 2188395 (Why is no real title available?)
• Graphs with a path partition for structuring digital spaces
• 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
• An asymptotic version of a conjecture by Enomoto and Ota

This page was built for publication: Graph partition into paths containing specified vertices

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