On packing and covering numbers of graphs
From MaRDI portal
Publication:1185083
DOI10.1016/0012-365X(91)90316-TzbMATH Open0759.05077MaRDI QIDQ1185083FDOQ1185083
Publication date: 28 June 1992
Published in: Discrete Mathematics (Search for Journal in Brave)
Recommendations
- On the packing numbers in graphs
- scientific article
- On relation between packing and covering number of graphs.
- Publication:4940073
- Packings in complete graphs
- scientific article; zbMATH DE number 1229732
- On Two Conjectures on Packing of Graphs
- scientific article; zbMATH DE number 1022391
- Packing of graphs - a survey
- On the \(k\)-limited packing numbers in graphs
Cites Work
- Title not available (Why is that?)
- Parallel concepts in graph theory
- Domination critical graphs
- Title not available (Why is that?)
- The k-Domination and k-Stability Problems on Sun-Free Chordal Graphs
- On graphs having domination number half their order
- Relations between packing and covering numbers of a tree
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On domination and independence numbers of graphs
- Title not available (Why is that?)
- Covering, Packing and Generalized Perfection
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (39)
- Distance Domination in Graphs
- Packings and perfect path double covers of maximal planar graphs
- The packing number and Laplacian spectrum of a graph
- Packing a number of copies of a \(( p , q )\)-graph
- On the packing numbers in graphs
- Title not available (Why is that?)
- Incidence dimension and 2-packing number in graphs
- Integer and fractional packing of families of graphs
- Some new results on distance \(k\)-domination in graphs
- On Two Conjectures on Packing of Graphs
- Independent domination versus packing in subcubic graphs
- Girth, minimum degree, independence, and broadcast independence
- The probabilistic approach to limited packings in graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Set covering and packing formulations of graph coloring: Algorithms and first polyhedral results
- An algorithm to find two distance domination parameters in a graph
- Covering, Packing and Generalized Perfection
- Liar's dominating sets in graphs
- Some results on packing graphs in their complements
- Packing of graphs - a survey
- Covering and packing in graphs. V. Mispacking subcubes in hypercubes
- UPPER BOUNDS ON THE LOWER OPEN PACKING NUMBER OF A TREE
- Distance domination in graphs with given minimum and maximum degree
- Title not available (Why is that?)
- On the Choice Number of Packings
- More on limited packings in graphs
- Extremal values on Zagreb indices of trees with given distance \(k\)-domination number
- On relation between packing and covering number of graphs.
- Packing parameters in graphs
- Packing in trees
- Extremal multiplicative Zagreb indices among trees with given distance k-domination number
- A lower bound for the distance \(k\)-domination number of trees
- Title not available (Why is that?)
- Cartesian product graphs and k-tuple total domination
- Title not available (Why is that?)
- A note on the open packing number in graphs
- The ratio of the distance irredundance and domination numbers of a graph
This page was built for publication: On packing and covering numbers of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1185083)
