The following pages link to (Q3166469):
Displaying 11 items.
- Minimum \(H\)-decompositions of graphs: edge-critical case (Q414645) (← links)
- An improved error term for minimum \(H\)-decompositions of graphs (Q740649) (← links)
- Turán function and \(H\)-decomposition problem for gem graphs (Q1649911) (← links)
- Decomposing uniform hypergraphs into uniform hypertrees and single edges (Q2032883) (← links)
- Turán number and decomposition number of intersecting odd cycles (Q2411603) (← links)
- Monochromatic Clique Decompositions of Graphs (Q3466344) (← links)
- Decomposition of Graphs into (k,r)‐Fans and Single Edges (Q4604014) (← links)
- Decompositions of Graphs into Fans and Single Edges (Q5272925) (← links)
- Monochromatic <i>K<sub>r</sub></i>‐Decompositions of Graphs (Q5418770) (← links)
- Minimum rainbow \(H\)-decompositions of graphs (Q5915832) (← links)
- Minimum rainbow \(H\)-decompositions of graphs (Q5916053) (← links)
