Pages that link to "Item:Q1732759"
From MaRDI portal
The following pages link to Gallai's path decomposition conjecture for graphs of small maximum degree (Q1732759):
Displaying 19 items.
- Gallai's path decomposition conjecture for triangle-free planar graphs (Q1732776) (← links)
- Path decompositions and Gallai's conjecture (Q1767666) (← links)
- Gallai's conjecture for disconnected graphs (Q1970699) (← links)
- On computing the path number of a graph (Q2132346) (← links)
- Path decompositions of triangle-free graphs (Q2138955) (← links)
- Upper bounds for bar visibility of subgraphs and \(n\)-vertex graphs (Q2192084) (← links)
- On Gallai's conjecture for graphs with maximum degree 6 (Q2214064) (← links)
- Gallai's conjecture for graphs with treewidth 3 (Q2413163) (← links)
- Decompositions of 6-regular bipartite graphs into paths of length six (Q2657084) (← links)
- Graph theory. Abstracts from the workshop held January 2--8, 2022 (Q2693028) (← links)
- Path and cycle decompositions of dense graphs (Q3384033) (← 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)
- Mader's conjecture for graphs with small connectivity (Q6057633) (← 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)
- Transitive path decompositions of Cartesian products of complete graphs (Q6651915) (← links)
