Pages that link to "Item:Q4871079"
From MaRDI portal
The following pages link to Vertex coverings of the edge set in a connected graph (Q4871079):
Displaying 19 items.
- Hypergraphs with large domination number and with edge sizes at least three (Q444441) (← links)
- Transversals and domination in uniform hypergraphs (Q649007) (← links)
- Strong and weak edges of a graph and linkages with the vertex cover problem (Q765356) (← links)
- Cores of simplicial complexes (Q958242) (← links)
- Covering projections of graphs preserving links of vertices and edges (Q1339869) (← links)
- Covering the edges of a connected graph by paths (Q1907117) (← links)
- A new upper bound on the total domination number in graphs with minimum degree six (Q2043347) (← links)
- Lower bounds on Tuza constants for transversals in linear uniform hypergraphs (Q2231740) (← links)
- Properties of vertex cover obstructions (Q2455575) (← links)
- Transversal game on hypergraphs and the \(\frac{3}{4}\)-conjecture on the total domination game (Q2821619) (← links)
- Total vertex covers (Q2839639) (← links)
- On the minimal number of vertices representing the edges of a graph (Q3284375) (← links)
- Domination and Total Domination in Hypergraphs (Q3384117) (← links)
- Connected Vertex Covers in Dense Graphs (Q3541785) (← links)
- (Q3807258) (← links)
- Covering the edges with consecutive sets (Q3984464) (← links)
- Connected vertex cover for \((sP_1+P_5)\)-free graphs (Q5915592) (← links)
- A note on the Tuza constant \(c_k\) for small \(k\) (Q6184535) (← links)
- An upper bound for the transversal number of connected \(k\)-uniform hypergraphs (Q6601976) (← links)
