Path decompositions and Gallai's conjecture

DOI10.1016/j.jctb.2004.09.008zbMath1057.05064OpenAlexW1965187305MaRDI QIDQ1767666

Geng-Hua Fan

Publication date: 8 March 2005

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jctb.2004.09.008

zbMATH Keywords

DecompositionGallai's conjecturePath

Mathematics Subject Classification ID

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

Related Items (18)

On computing the path number of a graph ⋮ Path decompositions of triangle-free graphs ⋮ An overview of graph covering and partitioning ⋮ On path decompositions of \(2k\)-regular graphs ⋮ On path decompositions of \(2 k\)-regular graphs ⋮ Gallai's conjecture for graphs with treewidth 3 ⋮ Walks, partitions, and normal ordering ⋮ Gallai's conjecture on path decompositions ⋮ Towards Gallai's path decomposition conjecture ⋮ On Gallai's conjecture for graphs with maximum degree 6 ⋮ Cleaning a network with brushes ⋮ Gallai's path decomposition conjecture for graphs of small maximum degree ⋮ Gallai's path decomposition conjecture for triangle-free planar graphs ⋮ Minimal path decomposition of complete bipartite graphs ⋮ Gallai's Conjecture For Graphs of Girth at Least Four ⋮ The conjunction of the linear arboricity conjecture and Lovász's path partition theorem ⋮ Path and cycle decompositions of dense graphs ⋮ Decompositions of triangle-free 5-regular graphs into paths of length five

Cites Work

• Subgraph coverings and edge switchings
• Covering the edges of a connected graph by paths
• Gallai's conjecture for disconnected graphs
• An upper bound for the path number of a graph
• Unnamed Item
• Unnamed Item

This page was built for publication: Path decompositions and Gallai's conjecture