Path decomposition of graphs with given path length

DOI10.1007/S10255-006-0337-0zbMath1107.05077OpenAlexW2025661191MaRDI QIDQ861415

Ming-qing Zhai, Chang-hong Lu

Publication date: 29 January 2007

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10255-006-0337-0

Mathematics Subject Classification ID

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

Related Items (6)

FORK-DECOMPOSITION OF DIRECT PRODUCT OF GRAPHS ⋮ An overview of graph covering and partitioning ⋮ On path decompositions of \(2k\)-regular graphs ⋮ On path decompositions of \(2 k\)-regular graphs ⋮ Minimal path decomposition of complete bipartite graphs ⋮ Strong labelings of linear forests

Cites Work

• Unnamed Item
• Covering the edges of a connected graph by paths
• E ₁₁ and M theory
• Paths, Stars and the Number Three

This page was built for publication: Path decomposition of graphs with given path length