The problem of path decomposition for graphs with treewidth at most 4

DOI10.1016/j.disc.2024.113957MaRDI QIDQ6494937

Chang-hong Lu, Niping Yi

Publication date: 30 April 2024

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

treewidth\(k\)-treepath decompositionGallai's conjecture

Mathematics Subject Classification ID

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

This page was built for publication: The problem of path decomposition for graphs with treewidth at most 4