Pages that link to "Item:Q805638"
From MaRDI portal
The following pages link to Finding dominating cliques efficiently, in strongly chordal graphs and undirected path graphs (Q805638):
Displaying 13 items.
- Bibliography on domination in graphs and some basic definitions of domination parameters (Q810066) (← links)
- A linear-time algorithm for paired-domination problem in strongly chordal graphs (Q990092) (← links)
- Minimum partition of an independence system into independent sets (Q1013303) (← links)
- Dominating cliques in chordal graphs (Q1322189) (← links)
- \(r\)-dominating cliques in graphs with hypertree structure (Q1356657) (← links)
- A note on \(r\)-dominating cliques (Q1382816) (← links)
- Complexity of distance paired-domination problem in graphs (Q1758170) (← links)
- Revising Johnson's table for the 21st century (Q2091799) (← links)
- On connected dominating sets of restricted diameter (Q2356248) (← links)
- Semicomplete absorbent sets in digraphs (Q4956182) (← links)
- Dominating cliques in distance-hereditary graphs (Q5054776) (← links)
- Weighted connected \(k\)-domination and weighted \(k\)-dominating clique in distance-hereditary graphs (Q5941496) (← links)
- A linear-time algorithm for semitotal domination in strongly chordal graphs (Q6110593) (← links)
