Pages that link to "Item:Q1117254"
From MaRDI portal
The following pages link to Labeling algorithms for domination problems in sun-free chordal graphs (Q1117254):
Displayed 15 items.
- Bibliography on domination in graphs and some basic definitions of domination parameters (Q810066) (← links)
- The weighted perfect domination problem (Q912630) (← links)
- Approximation algorithms for forests augmentation ensuring two disjoint paths of bounded length (Q935155) (← links)
- A survey of selected recent results on total domination in graphs (Q998491) (← links)
- Weighted connected domination and Steiner trees in distance-hereditary graphs (Q1270785) (← links)
- A linear time algorithm to solve the weighted perfect domination problem in series-parallel graphs (Q1328622) (← links)
- The \(k\)-neighbor, \(r\)-domination problems on interval graphs (Q1342074) (← links)
- \(r\)-dominating cliques in graphs with hypertree structure (Q1356657) (← links)
- The algorithmic use of hypertree structure and maximum neighbourhood orderings (Q1383368) (← links)
- Chromatic numbers of competition graphs (Q1805322) (← links)
- The weighted perfect domination problem and its variants (Q1917310) (← links)
- Domination and total domination on asteroidal triple-free graphs (Q1962038) (← links)
- Strongly orderable graphs. A common generalization of strongly chordal and chordal bipartite graphs (Q1962062) (← links)
- Weighted connected \(k\)-domination and weighted \(k\)-dominating clique in distance-hereditary graphs (Q5941496) (← links)
- Domination in distance-hereditary graphs (Q5957300) (← links)