Pages that link to "Item:Q1220937"

The following pages link to Relations between packing and covering numbers of a tree (Q1220937):

Displaying 50 items.

• Guarding polyominoes, polycubes and polyhypercubes (Q322213) (← links)
• A self-stabilizing algorithm to maximal 2-packing with improved complexity (Q436592) (← links)
• On hypercube packings, blocking sets and a covering problem (Q477608) (← links)
• Distance domination, guarding and covering of maximal outerplanar graphs (Q479016) (← links)
• Independent sets in graphs (Q501998) (← links)
• Distance 2-domination in prisms of graphs (Q521756) (← links)
• Matchings and transversals in hypergraphs, domination and independence in trees (Q599067) (← links)
• Dominating sets, packings, and the maximum degree (Q641164) (← links)
• \(k\)-domination and \(k\)-independence in graphs: A survey (Q659765) (← links)
• Dominating set games. (Q703283) (← links)
• Average distance and generalised packing in graphs (Q708381) (← links)
• More on limited packings in graphs (Q782753) (← links)
• Bibliography on domination in graphs and some basic definitions of domination parameters (Q810066) (← links)
• The k-neighbor domination problem (Q811346) (← links)
• Amnesiac flooding: synchronous stateless information dissemination (Q831783) (← links)
• A PTAS for the sparsest 2-spanner of 4-connected planar triangulations (Q876695) (← links)
• Bondage number of strong product of two paths (Q893339) (← links)
• The discrete p-dispersion problem (Q915643) (← links)
• A survey of selected recent results on total domination in graphs (Q998491) (← links)
• Domination subdivision numbers of trees (Q1011691) (← links)
• Powerful alliances in graphs (Q1025468) (← links)
• On the ratios between packing and domination parameters of a graph (Q1025506) (← links)
• Average distances and distance domination numbers (Q1028442) (← links)
• Analytical models for locating undesirable facilities (Q1118522) (← links)
• Universal maximal packing functions of graphs (Q1126177) (← links)
• Locational analysis (Q1173002) (← links)
• On packing and covering numbers of graphs (Q1185083) (← links)
• On the \(r\)-domination number of a graph (Q1197015) (← links)
• Eigenvalues and separation in graphs (Q1209408) (← links)
• Geodesic visibility in graphs (Q1292576) (← links)
• On \(m\)-centers in \(P_ t\)-free graphs (Q1322266) (← links)
• A recurrence template for several parameters in series-parallel graphs (Q1336624) (← links)
• Regular codes in regular graphs are difficult (Q1336698) (← links)
• New results about the bondage number of a graph (Q1363706) (← links)
• Packing in trees (Q1584274) (← links)
• Interpolation theorems for domination numbers of a graph (Q1584415) (← links)
• Bounds on the burning number (Q1682876) (← links)
• Extremal values on Zagreb indices of trees with given distance \(k\)-domination number (Q1691326) (← links)
• Alliances in graphs: parameters, properties and applications -- a survey (Q1713564) (← links)
• Optimal \((t, r)\) broadcasts on the infinite grid (Q1727739) (← links)
• Average eccentricity, \(k\)-packing and \(k\)-domination in graphs (Q1732757) (← links)
• On the number of 2-packings in a connected graph (Q1761463) (← links)
• Least domination in a graph (Q1916102) (← links)
• An algorithm to find two distance domination parameters in a graph (Q1917347) (← links)
• On bondage numbers of graphs: a survey with some comments (Q1953664) (← links)
• New bounds for the broadcast domination number of a graph (Q1955610) (← links)
• Tightness of domination inequalities for direct product graphs (Q2037578) (← links)
• On the 2-packing differential of a graph (Q2044595) (← links)
• Orientable domination in product-like graphs (Q2109114) (← links)
• Vertex cover at distance on \(H\)-free graphs (Q2115860) (← links)