Pages that link to "Item:Q1916100"
From MaRDI portal
The following pages link to Covering and independence in triangle structures (Q1916100):
Displaying 15 items.
- Induced cycles in triangle graphs (Q298987) (← links)
- Trinque problem: covering complete graphs by plane degree-bounded hypergraphs (Q511700) (← links)
- Smallest universal covers for families of triangles (Q827315) (← links)
- Essential coverings and triangulations (Q1094709) (← links)
- Small edge sets meeting all triangles of a graph (Q1926043) (← links)
- Triangle packing and covering in dense random graphs (Q2084667) (← links)
- Characterizing 3-uniform linear extremal hypergraphs on feedback vertex number (Q2091099) (← links)
- extremal aspects of the Erdős-Gallai-Tuza conjecture (Q2342626) (← links)
- A note on bipartite subgraphs and triangle-independent sets (Q2374154) (← links)
- Graphs with \(\alpha _1\) and \(\tau _1\) both large (Q2413631) (← links)
- On a Conjecture of Erdős, Gallai, and Tuza (Q2947853) (← links)
- The minimum number of triangles covering the edges of a graph (Q3201088) (← links)
- (Q5466038) (← links)
- Independent triangles covering given vertices of a graph (Q5941524) (← links)
- Covering the edges of a graph with triangles (Q6635092) (← links)