Pages that link to "Item:Q1907117"
From MaRDI portal
The following pages link to Covering the edges of a connected graph by paths (Q1907117):
Displaying 27 items.
- On path decompositions of \(2k\)-regular graphs (Q324765) (← links)
- Path decomposition of graphs with given path length (Q861415) (← 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)
- Path decompositions and Gallai's conjecture (Q1767666) (← links)
- Subgraph coverings and edge switchings (Q1850576) (← 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)
- On path decompositions of \(2 k\)-regular graphs (Q2400577) (← links)
- Gallai's conjecture for graphs with treewidth 3 (Q2413163) (← links)
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
- Path and cycle decompositions of dense graphs (Q3384033) (← links)
- (Q4558068) (← links)
- Nordhaus-gaddum type inequalities for tree covering numbers on unitary cayley graphs of finite rings (Q5103954) (← links)
- Cycle packing (Q5256386) (← 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)
- Towards the Erdős-Gallai cycle decomposition conjecture (Q6184561) (← 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)
