Pages that link to "Item:Q3697054"
From MaRDI portal
The following pages link to The <i>k</i>-Domination and <i>k</i>-Stability Problems on Sun-Free Chordal Graphs (Q3697054):
Displayed 40 items.
- Domination, independent domination, and duality in strongly chordal graphs (Q788002) (← links)
- Bibliography on domination in graphs and some basic definitions of domination parameters (Q810066) (← links)
- Distance irredundance and connected domination numbers of a graph (Q860459) (← links)
- Locally connected spanning trees in strongly chordal graphs and proper circular-arc graphs (Q864162) (← links)
- The weighted perfect domination problem (Q912630) (← links)
- \(k\)-tuple domination in graphs (Q1014390) (← links)
- Characterizations of strongly chordal graphs (Q1051004) (← links)
- Pseudo-modular graphs (Q1084416) (← links)
- On diameters and radii of bridged graphs (Q1117245) (← links)
- Labeling algorithms for domination problems in sun-free chordal graphs (Q1117254) (← links)
- Total domination in block graphs (Q1124531) (← links)
- R-domination of block graphs (Q1171499) (← links)
- Representations of graphs and networks (coding, layouts and embeddings) (Q1174904) (← links)
- Centers of chordal graphs (Q1180670) (← links)
- Distances in cocomparability graphs and their powers (Q1183347) (← links)
- On packing and covering numbers of graphs (Q1185083) (← links)
- A linear time algorithm to solve the weighted perfect domination problem in series-parallel graphs (Q1328622) (← links)
- Radius versus diameter in cocomparability and intersection graphs (Q1356529) (← links)
- \(r\)-dominating cliques in graphs with hypertree structure (Q1356657) (← links)
- The algorithmic use of hypertree structure and maximum neighbourhood orderings (Q1383368) (← links)
- A characterization of strongly chordal graphs (Q1584312) (← links)
- Interpolation theorems for domination numbers of a graph (Q1584415) (← links)
- Chromatic numbers of competition graphs (Q1805322) (← links)
- Tree spanners on chordal graphs: complexity and algorithms (Q1884978) (← links)
- Powers of distance-hereditary graphs (Q1901030) (← links)
- Algorithmic aspects of the generalized clique-transversal problem on chordal graphs (Q1917287) (← links)
- The weighted perfect domination problem and its variants (Q1917310) (← links)
- An algorithm to find two distance domination parameters in a graph (Q1917347) (← links)
- Strongly orderable graphs. A common generalization of strongly chordal and chordal bipartite graphs (Q1962062) (← links)
- Algorithmic aspects of clique-transversal and clique-independent sets (Q1971220) (← links)
- Distance domination-critical graphs (Q2483152) (← links)
- A one-to-one correspondence between colorings and stable sets (Q2517790) (← links)
- Local medians in chordal graphs (Q2640607) (← links)
- Homogeneous sets and domination: A linear time algorithm for distance?hereditary graphs (Q2719843) (← links)
- Covering, Packing and Generalized Perfection (Q3220635) (← links)
- Lexbfs-orderings and powers of hhd-free graphs<sup>∗</sup> (Q4254590) (← links)
- Powers of hhd-free graphs<sup>∗</sup> (Q4256126) (← links)
- The ratio of the distance irredundance and domination numbers of a graph (Q4277983) (← links)
- Total domination in interval graphs (Q5903263) (← links)
- Weighted connected \(k\)-domination and weighted \(k\)-dominating clique in distance-hereditary graphs (Q5941496) (← links)