Gallai's conjecture on path decompositions
From MaRDI portal
(Redirected from Gallai's conjecture on path decompositions)
Recommendations
Cites work
- An upper bound for the path number of a graph
- Covering the edges of a connected graph by paths
- Gallai's conjecture for disconnected graphs
- Gallai's path decomposition conjecture for graphs of small maximum degree
- 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 path decompositions of \(2 k\)-regular graphs
- Path decompositions and Gallai's conjecture
- Towards Gallai's path decomposition conjecture
Cited in
(8)- Gallai's path decomposition conjecture for triangle-free planar graphs
- A human proof of Gessel's lattice path conjecture
- The Path Partition Conjecture
- Gallai's Path Decomposition for 2-degenerate Graphs
- Gallai's conjecture for 3-degenerated graphs
- Gallai's path decomposition conjecture for graphs with maximum E-degree at most 3
- Path decompositions of Eulerian graphs
- Gallai's conjecture and the path number of odd semi-cliques
This page was built for publication: Gallai's conjecture on path decompositions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6047576)
