A degree sum condition for the existence of a path-factor.

MaRDI QIDQ2936733zbMATHFDO

Authors Shuya Chiba, Masao Tsugaki

Publication date 6 January 2015

zbMATH Keywords

2-connected graphpath-factorgraph degree

Mathematics Subject Classification ID

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

Recommendations

• Degree sums and path-factors in graphs
• An El-Zah�r type condition ensuring path-factors
• Ore‐type condition for the existence of connected factors
• A degree condition for the existence ofk-factors
• scientific article; zbMATH DE number 913257

Cited in

(9)

• On degree sum conditions for directed path-factors with a specified number of paths
• Degree conditions for path-factors in graphs
• Sufficient conditions for the existence of a path-factor which are related to odd components
• scientific article; zbMATH DE number 7691485 (Why is no real title available?)
• Degree sum conditions for path-factors with specified end vertices in bipartite graphs
• Degree conditions for the existence of vertex-disjoint cycles and paths: a survey
• Vertex-disjoint subgraphs with high degree sums
• A necessary and sufficient condition for the existence of a path factor every component of which is a path of length at least two
• Degree conditions for the existence of a {P₂, P₅}-factor in a graph

This page was built for publication: A degree sum condition for the existence of a path-factor.

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