The problem of path decomposition for graphs with treewidth at most 4
From MaRDI portal
Recommendations
- Gallai's path decomposition conjecture for graphs with treewidth at most 3
- Gallai's path decomposition conjecture for triangle-free planar graphs
- Gallai's conjecture for graphs of girth at least four
- Gallai's path decomposition conjecture for graphs of small maximum degree
- Path decompositions and Gallai's conjecture
Cites work
- A partial k-arboretum of graphs with bounded treewidth
- An upper bound for the path number of a graph
- Beautiful conjectures in graph theory
- Covering the edges of a connected graph by paths
- Decompositions of 6-regular bipartite graphs into paths of length six
- Gallai's conjecture for disconnected graphs
- 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
- Graph theory
- scientific article; zbMATH DE number 3948320 (Why is no real title available?)
- scientific article; zbMATH DE number 3253072 (Why is no real title available?)
- Path decompositions and Gallai's conjecture
- Towards Gallai's path decomposition conjecture
This page was built for publication: The problem of path decomposition for graphs with treewidth at most 4
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6494937)
