Pages that link to "Item:Q726109"
From MaRDI portal
The following pages link to Covering triangles in edge-weighted graphs (Q726109):
Displaying 5 items.
- Approximation algorithms on \(k\)-cycle transversal and \(k\)-clique transversal (Q2059196) (← links)
- Triangle packing and covering in dense random graphs (Q2084667) (← links)
- Characterizing 3-uniform linear extremal hypergraphs on feedback vertex number (Q2091099) (← links)
- A sharp upper bound for the transversal number of \(k\)-uniform connected hypergraphs with given size (Q2111206) (← links)
- On the feedback number of 3-uniform linear extremal hypergraphs (Q2150590) (← links)
