Pages that link to "Item:Q1767666"
From MaRDI portal
The following pages link to Path decompositions and Gallai's conjecture (Q1767666):
Displaying 19 items.
- On path decompositions of \(2k\)-regular graphs (Q324765) (← links)
- Walks, partitions, and normal ordering (Q888618) (← links)
- Cleaning a network with brushes (Q930892) (← 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)
- Minimal path decomposition of complete bipartite graphs (Q1743479) (← links)
- The conjunction of the linear arboricity conjecture and Lovász's path partition theorem (Q2032853) (← links)
- On computing the path number of a graph (Q2132346) (← links)
- Path decompositions of triangle-free graphs (Q2138955) (← links)
- An overview of graph covering and partitioning (Q2142633) (← links)
- On Gallai's conjecture for graphs with maximum degree 6 (Q2214064) (← links)
- Decompositions of triangle-free 5-regular graphs into paths of length five (Q2352046) (← links)
- On path decompositions of \(2 k\)-regular graphs (Q2400577) (← links)
- Gallai's conjecture for graphs with treewidth 3 (Q2413163) (← links)
- Path and cycle decompositions of dense graphs (Q3384033) (← links)
- Gallai's Conjecture For Graphs of Girth at Least Four (Q5417821) (← 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)
