The following pages link to Dominating cliques in graphs (Q5925264):
Displaying 26 items.
- A new characterization of \(P_k\)-free graphs (Q300476) (← links)
- Finding dominating cliques efficiently, in strongly chordal graphs and undirected path graphs (Q805638) (← links)
- Clustering and domination in perfect graphs (Q1068110) (← links)
- Dominating sets in social network graphs (Q1108233) (← links)
- Dominating cliques in chordal graphs (Q1322189) (← links)
- A note on \(r\)-dominating cliques (Q1382816) (← links)
- Algorithms for dominating clique problems (Q1758169) (← links)
- On identifying dominant cliques. (Q1811147) (← links)
- A proof of a conjecture on the connected domination number (Q2091175) (← links)
- Domination on hyperbolic graphs (Q2198410) (← links)
- Structural domination and coloring of some \(( P_7 , C_7)\)-free graphs (Q2222949) (← links)
- New results on connected dominating structures in graphs (Q2283728) (← links)
- A characterization of \(P_5\)-free graphs with a homeomorphically irreducible spanning tree (Q2341717) (← links)
- Domination, coloring and stability in \(P_5\)-reducible graphs (Q2341757) (← links)
- On connected dominating sets of restricted diameter (Q2356248) (← links)
- Finding minimum clique capacity (Q2392036) (← links)
- Minimal asymmetric graphs (Q2407386) (← links)
- Uniform clutters and dominating sets of graphs (Q2420426) (← links)
- On dominating sets whose induced subgraphs have a bounded diameter (Q2444556) (← links)
- An exact algorithm for the minimum dominating clique problem (Q2456374) (← links)
- Clique independence, domination and irredundance in graphs (Q2799813) (← links)
- Dominating sets with small clique covering number (Q4344210) (← links)
- Semicomplete absorbent sets in digraphs (Q4956182) (← links)
- (Q5076537) (← links)
- Weighted connected \(k\)-domination and weighted \(k\)-dominating clique in distance-hereditary graphs (Q5941496) (← links)
- Exact and parameterized algorithms for the independent cutset problem (Q6655670) (← links)
