Bounds for the covering number of a graph

DOI10.1016/0012-365X(79)90083-9zbMath0393.05032MaRDI QIDQ1252353

K. Appert

Publication date: 1979

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

Lower BoundsUpper BoundsCovering Number

Mathematics Subject Classification ID

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

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the ratio of optimal integral and fractional covers
• Parallel concepts in graph theory
• Two combinatorial covering theorems
• Puncture sets
• Two Bounds for the Domination Number of a Graph