scientific article; zbMATH DE number 861353
From MaRDI portal
Publication:4871079
zbMATH Open0842.05046MaRDI QIDQ4871079FDOQ4871079
Authors: Zsolt Tuza, P. Erdős 
Publication date: 17 July 1996
Title of this publication is not available (Why is that?)
Recommendations
Extremal problems in graph theory (05C35) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cited In (20)
- Properties of vertex cover obstructions
- Transversal game on hypergraphs and the \(\frac{3}{4}\)-conjecture on the total domination game
- Connected Vertex Covers in Dense Graphs
- Hypergraphs with large domination number and with edge sizes at least three
- Transversals and domination in uniform hypergraphs
- Lower bounds on Tuza constants for transversals in linear uniform hypergraphs
- Cores of simplicial complexes
- Title not available (Why is that?)
- An upper bound for the transversal number of connected \(k\)-uniform hypergraphs
- Covering number product bounds size
- A note on the Tuza constant \(c_k\) for small \(k\)
- Title not available (Why is that?)
- Domination and total domination in hypergraphs
- A new upper bound on the total domination number in graphs with minimum degree six
- Connected vertex cover for \((sP_1+P_5)\)-free graphs
- Strong and weak edges of a graph and linkages with the vertex cover problem
- Covering projections of graphs preserving links of vertices and edges
- Total vertex covers
- Covering the edges of a connected graph by paths
- Title not available (Why is that?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4871079)
