Path decompositions of Eulerian graphs

DOI10.1016/J.DISC.2025.114830MaRDI QIDQ6884360zbMATH OpenFDO

Authors Yanan Chu, Yan Wang

Publication date 15 December 2025

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DISC.2025.114830

zbMATH Keywords

Eulerian graphGallai's conjecturepath decomposition

Mathematics Subject Classification ID

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

Cites work

• An upper bound for the path number of a graph
• Covering the edges of a connected graph by paths
• Cycle packing
• Decomposing random graphs into few cycles and edges
• Gallai's conjecture for 3-degenerated graphs
• Gallai's conjecture for disconnected graphs
• Gallai's conjecture for graphs of girth at least four
• Gallai's conjecture on path decompositions
• Gallai's path decomposition conjecture for graphs of small maximum degree
• Gallai's path decomposition conjecture for graphs with treewidth at most 3
• Gallai's path decomposition conjecture for triangle-free planar graphs
• scientific article; zbMATH DE number 3948320 (Why is no real title available?)
• scientific article; zbMATH DE number 3253072 (Why is no real title available?)
• On Gallai's conjecture for graphs with maximum degree 6
• On path decompositions of \(2 k\)-regular graphs
• Optimal path and cycle decompositions of dense quasirandom graphs
• Path and cycle decompositions of dense graphs
• Path decompositions and Gallai's conjecture
• Path decompositions of triangle-free graphs
• The Representation of a Graph by Set Intersections
• Towards Gallai's path decomposition conjecture
• Towards the Erdős-Gallai cycle decomposition conjecture

This page was built for publication: Path decompositions of Eulerian graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6884360)