The following pages link to (Q3718751):
Displaying 17 items.
- On path decompositions of \(2k\)-regular graphs (Q324765) (← links)
- Hajós' conjecture and small cycle double covers of planar graphs (Q1197036) (← links)
- Small cycle double covers of 4-connected planar graphs (Q1316653) (← links)
- Gallai's path decomposition conjecture for graphs of small maximum degree (Q1732759) (← links)
- Gallai's path decomposition conjecture for triangle-free planar graphs (Q1732776) (← 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)
- On path decompositions of \(2 k\)-regular graphs (Q2400577) (← links)
- Decomposing toroidal graphs into circuits and edges (Q2486748) (← links)
- Decompositions of 6-regular bipartite graphs into paths of length six (Q2657084) (← links)
- Small oriented cycle double cover of graphs (Q5964911) (← 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)
