Pages that link to "Item:Q1732776"
From MaRDI portal
The following pages link to Gallai's path decomposition conjecture for triangle-free planar graphs (Q1732776):
Displaying 15 items.
- Decomposing series-parallel graphs into paths of length 3 and triangles (Q322267) (← links)
- Triangle-free circuit decompositions and Petersen minor (Q1272477) (← links)
- Gallai's path decomposition conjecture for graphs of small maximum degree (Q1732759) (← links)
- Path decompositions and Gallai's conjecture (Q1767666) (← links)
- On computing the path number of a graph (Q2132346) (← links)
- Path decompositions of triangle-free graphs (Q2138955) (← links)
- On Gallai's conjecture for graphs with maximum degree 6 (Q2214064) (← links)
- Farber's conjecture for planar graphs (Q2238222) (← links)
- Gallai's conjecture for graphs with treewidth 3 (Q2413163) (← links)
- Gallai's path decomposition conjecture for graphs with treewidth at most 3 (Q5110660) (← links)
- Gallai's conjecture on path decompositions (Q6047576) (← links)
- Towards Gallai's path decomposition conjecture (Q6055934) (← links)
- The problem of path decomposition for graphs with treewidth at most 4 (Q6494937) (← links)
- Gallai's conjecture for 3-degenerated graphs (Q6542059) (← links)
- Gallai's path decomposition conjecture for graphs with maximum \(E\)-degree at most 3 (Q6621169) (← links)
