The following pages link to An Erdős-Gallai conjecture (Q1068106):
Displaying 11 items.
- An Erdős-Gallai theorem for matroids (Q434226) (← links)
- Any four independent edges of a 4-connected graph are contained in a circuit (Q1073040) (← links)
- Covers of Eulerian graphs (Q1417961) (← links)
- Covering a graph by topological complete subgraphs (Q1813985) (← links)
- Subgraph coverings and edge switchings (Q1850576) (← links)
- An overview of graph covering and partitioning (Q2142633) (← links)
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
- Path and cycle decompositions of dense graphs (Q3384033) (← links)
- Cycle packing (Q5256386) (← links)
- Decomposing Random Graphs into Few Cycles and Edges (Q5364258) (← links)
- Towards the Erdős-Gallai cycle decomposition conjecture (Q6184561) (← links)
