Pages that link to "Item:Q1185083"

The following pages link to On packing and covering numbers of graphs (Q1185083):

Displaying 36 items.

• Liar's dominating sets in graphs (Q335352) (← links)
• Packings and perfect path double covers of maximal planar graphs (Q686163) (← links)
• Average distance and generalised packing in graphs (Q708381) (← links)
• More on limited packings in graphs (Q782753) (← links)
• Set covering and packing formulations of graph coloring: Algorithms and first polyhedral results (Q1015318) (← links)
• Covering and packing in graphs. V. Mispacking subcubes in hypercubes (Q1102983) (← links)
• Packing in trees (Q1584274) (← links)
• Extremal values on Zagreb indices of trees with given distance \(k\)-domination number (Q1691326) (← links)
• Packing of graphs - a survey (Q1825885) (← links)
• An algorithm to find two distance domination parameters in a graph (Q1917347) (← links)
• Packing a number of copies of a \(( p , q )\)-graph (Q2217483) (← links)
• Some new results on distance \(k\)-domination in graphs (Q2248720) (← links)
• Packing parameters in graphs (Q2259558) (← links)
• The probabilistic approach to limited packings in graphs (Q2341760) (← links)
• Distance domination in graphs with given minimum and maximum degree (Q2410104) (← links)
• A lower bound for the distance \(k\)-domination number of trees (Q2581114) (← links)
• Some results on packing graphs in their complements (Q2761066) (← links)
• The packing number and Laplacian spectrum of a graph (Q2935367) (← links)
• (Q3011727) (← links)
• (Q3316129) (← links)
• Distance Domination in Graphs (Q3384610) (← links)
• (Q3818329) (← links)
• (Q4222171) (← links)
• UPPER BOUNDS ON THE LOWER OPEN PACKING NUMBER OF A TREE (Q4262044) (← links)
• The ratio of the distance irredundance and domination numbers of a graph (Q4277983) (← links)
• On the packing numbers in graphs (Q4614038) (← links)
• Integer and fractional packing of families of graphs (Q4667859) (← links)
• On the Choice Number of Packings (Q4906043) (← links)
• Extremal multiplicative Zagreb indices among trees with given distance k-domination number (Q5001524) (← links)
• Incidence dimension and 2-packing number in graphs (Q5034794) (← links)
• Cartesian product graphs and k-tuple total domination (Q5086876) (← links)
• A note on the open packing number in graphs (Q5227166) (← links)
• Girth, minimum degree, independence, and broadcast independence (Q5242945) (← links)
• (Q5488365) (← links)
• On Two Conjectures on Packing of Graphs (Q5704386) (← links)
• Independent domination versus packing in subcubic graphs (Q6611014) (← links)