Path-factors in the square of a tree

DOI10.1007/S00373-008-0775-YzbMath1155.05053OpenAlexW2091503166MaRDI QIDQ937248

Zhao Zhang, Xiaojuan Li

Publication date: 20 August 2008

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-008-0775-y

Mathematics Subject Classification ID

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

Related Items (4)

\(P_3\)-factors in the square of a tree ⋮ \(P_k\)-factors in squares and line graphs of trees ⋮ Path factors and parallel knock-out schemes of almost claw-free graphs ⋮ Some results about component factors in graphs

Cites Work

• Unnamed Item
• Unnamed Item
• A necessary and sufficient condition for the existence of a path factor every component of which is a path of length at least two
• Packing paths of length at least two
• On the Complexity of General Graph Factor Problems
• Path factors in cubic graphs
• Factors and factorizations of graphs—a survey
• [https://portal.mardi4nfdi.de/wiki/Publication:4242796 An El-Zah�r type condition ensuring path-factors]
• Path factors of bipartite graphs
• On the completeness of a generalized matching problem
• Path factors in claw-free graphs

This page was built for publication: Path-factors in the square of a tree