Towards Gallai's path decomposition conjecture

DOI10.1002/jgt.22647zbMath1521.05149arXiv1911.04546OpenAlexW3109458516WikidataQ123323380 ScholiaQ123323380MaRDI QIDQ6055934

Fábio Botler, Maycon Sambinelli

Publication date: 29 September 2023

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1911.04546

zbMATH Keywords

decompositionpathmaximum degreeGallai's conjectureE-subgraph

Mathematics Subject Classification ID

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

Related Items (2)

Path decompositions of triangle-free graphs ⋮ Gallai's conjecture on path decompositions

Cites Work

• Unnamed Item
• 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
• On computing the path number of a graph
• On path decompositions of \(2 k\)-regular graphs
• Beautiful conjectures in graph theory
• On path-cycle decompositions of triangle-free graphs
• Gallai's path decomposition conjecture for graphs with treewidth at most 3

This page was built for publication: Towards Gallai's path decomposition conjecture