Gallai's conjecture on path decompositions

DOI10.1007/s40305-022-00435-3OpenAlexW4307067975WikidataQ123358574 ScholiaQ123358574MaRDI QIDQ6047576

Jian-Feng Hou, Chuixiang Zhou, Geng-Hua Fan

Publication date: 12 September 2023

Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40305-022-00435-3

zbMATH Keywords

triangledecompositionpathGallai's conjecture

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Gallai's path decomposition conjecture for graphs of small maximum degree
• Gallai's path decomposition conjecture for triangle-free planar graphs
• Path decompositions and Gallai's conjecture
• Covering the edges of a connected graph by paths
• Gallai's conjecture for disconnected graphs
• On path decompositions of \(2 k\)-regular graphs
• An upper bound for the path number of a graph
• Towards Gallai's path decomposition conjecture

This page was built for publication: Gallai's conjecture on path decompositions