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

MaRDI QIDQ6621169FDOQ6621169

Authors: F. Botler, Maycon Sambinelli 

Publication date: 18 October 2024

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

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

Mathematics Subject Classification ID

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

Cites Work

• Graph theory
• Title not available (Why is that?)
• Path decompositions and Gallai's conjecture
• Covering the edges of a connected graph by paths
• On path decompositions of \(2 k\)-regular graphs
• Title not available (Why is that?)
• Beautiful conjectures in graph theory
• Gallai's path decomposition conjecture for triangle-free planar graphs
• On path-cycle decompositions of triangle-free graphs
• Gallai's path decomposition conjecture for graphs of small maximum degree

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)