Gallai's path decomposition conjecture for graphs with maximum E-degree at most 3

MaRDI QIDQ6621169zbMATH OpenFDO

Authors F. Botler, Maycon Sambinelli

Publication date 18 October 2024

Published in Acta Mathematica Universitatis Comenianae. New Series (Search for Journal in Brave)

Mathematics Subject Classification ID

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

Recommendations

• Towards Gallai's path decomposition conjecture
• Gallai's conjecture on path decompositions
• Gallai's path decomposition conjecture for triangle-free planar graphs
• Path decompositions and Gallai's conjecture
• Gallai's path decomposition conjecture for graphs of small maximum degree

Cites work

• scientific article; zbMATH DE number 3948320 (Why is no real title available?)
• scientific article; zbMATH DE number 3253072 (Why is no real title available?)
• Beautiful conjectures in graph theory
• Covering the edges of a connected graph by paths
• Gallai's path decomposition conjecture for graphs of small maximum degree
• Gallai's path decomposition conjecture for triangle-free planar graphs
• Graph theory
• On path decompositions of \(2 k\)-regular graphs
• On path-cycle decompositions of triangle-free graphs
• Path decompositions and Gallai's conjecture

Cited in

(1)

• Gallai's conjecture on path decompositions

This page was built for publication: Gallai's path decomposition conjecture for graphs with maximum \(E\)-degree at most 3

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