On packing and covering numbers of graphs

DOI10.1016/0012-365X(91)90316-TzbMath0759.05077MaRDI QIDQ1185083

Lutz Volkmann, Jerzy Topp

Publication date: 28 June 1992

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

zbMATH Keywords

partitioncoveringpackingtreesblock graphconnected graphs

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (18)

UPPER BOUNDS ON THE LOWER OPEN PACKING NUMBER OF A TREE ⋮ The ratio of the distance irredundance and domination numbers of a graph ⋮ Girth, minimum degree, independence, and broadcast independence ⋮ Liar's dominating sets in graphs ⋮ An algorithm to find two distance domination parameters in a graph ⋮ Cartesian product graphs and k-tuple total domination ⋮ Distance domination in graphs with given minimum and maximum degree ⋮ Extremal values on Zagreb indices of trees with given distance \(k\)-domination number ⋮ Unnamed Item ⋮ Some new results on distance \(k\)-domination in graphs ⋮ Packing parameters in graphs ⋮ Distance Domination in Graphs ⋮ A note on the open packing number in graphs ⋮ More on limited packings in graphs ⋮ Extremal multiplicative Zagreb indices among trees with given distance k-domination number ⋮ Packing in trees ⋮ The probabilistic approach to limited packings in graphs ⋮ A lower bound for the distance \(k\)-domination number of trees

Cites Work

• On graphs having domination number half their order
• Relations between packing and covering numbers of a tree
• Parallel concepts in graph theory
• On domination and independence numbers of graphs
• Covering, Packing and Generalized Perfection
• The k-Domination and k-Stability Problems on Sun-Free Chordal Graphs
• Domination critical graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On packing and covering numbers of graphs