Pages that link to "Item:Q5890517"
From MaRDI portal
The following pages link to Optimal path and cycle decompositions of dense quasirandom graphs (Q5890517):
Displaying 17 items.
- Towards the linear arboricity conjecture (Q1985445) (← links)
- The conjunction of the linear arboricity conjecture and Lovász's path partition theorem (Q2032853) (← links)
- Long path and cycle decompositions of even hypercubes (Q2033926) (← links)
- On computing the path number of a graph (Q2132346) (← links)
- Chromatic index of dense quasirandom graphs (Q2171027) (← links)
- Optimal packings of bounded degree trees (Q2279501) (← links)
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
- Path and cycle decompositions of dense graphs (Q3384033) (← links)
- A blow-up lemma for approximate decompositions (Q4633567) (← links)
- (Q5890898) (redirect page) (← links)
- Graph and hypergraph colouring via nibble methods: a survey (Q6086395) (← links)
- A proof of the Erdős-Faber-Lovász conjecture (Q6093285) (← links)
- Linear arboricity of degenerate graphs (Q6094033) (← links)
- Edge coloring graphs with large minimum degree (Q6094039) (← links)
- A decomposition method on solving the linear arboricity conjecture (Q6143389) (← links)
- Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022 (Q6170531) (← links)
- Towards the Erdős-Gallai cycle decomposition conjecture (Q6184561) (← links)
