Bounds for the covering number of a graph
From MaRDI portal
Publication:1252353
DOI10.1016/0012-365X(79)90083-9zbMath0393.05032MaRDI QIDQ1252353
Publication date: 1979
Published in: Discrete Mathematics (Search for Journal in Brave)
Extremal problems in graph theory (05C35) Graph theory (05C99) Combinatorial aspects of packing and covering (05B40)
Related Items
The k-Domination and k-Stability Problems on Sun-Free Chordal Graphs ⋮ Bipartite dimensions and bipartite degrees of graphs ⋮ Bibliography on domination in graphs and some basic definitions of domination parameters
Cites Work