The following pages link to Dominating cliques in graphs (Q5896554):
Displaying 22 items.
- On the existence of total dominating subgraphs with a prescribed additive hereditary property (Q641172) (← links)
- Domination properties and induced subgraphs (Q686437) (← links)
- Finding dominating cliques efficiently, in strongly chordal graphs and undirected path graphs (Q805638) (← links)
- Bibliography on domination in graphs and some basic definitions of domination parameters (Q810066) (← links)
- Characterization of graphs dominated by induced paths (Q868348) (← links)
- Hereditarily dominated graphs (Q868368) (← links)
- Characterization of \(P_{6}\)-free graphs (Q881583) (← links)
- Infinite versus finite graph domination (Q968422) (← links)
- A new characterization of \(P_{6}\)-free graphs (Q972332) (← links)
- Minimum partition of an independence system into independent sets (Q1013303) (← links)
- Complete description of forbidden subgraphs in the structural domination problem (Q1025505) (← links)
- Clustering and domination in perfect graphs (Q1068110) (← links)
- Dominating cliques in \(P_ 5\)-free graphs (Q1176051) (← links)
- Dominating cliques in chordal graphs (Q1322189) (← links)
- Dominating subgraphs in graphs with some forbidden structures (Q1343259) (← links)
- \(H\)-domination in graphs (Q1415548) (← links)
- Algorithmic aspects of semitotal domination in graphs (Q1731849) (← links)
- The complexity of connected dominating sets and total dominating sets with specified induced subgraphs (Q1941700) (← links)
- The parametric complexity of graph diameter augmentation (Q2446345) (← links)
- On-line graph coloring of \({\mathbb{P}_5}\)-free graphs (Q2482722) (← links)
- (Q3353058) (← links)
- Dominating cliques in graphs (Q5925264) (← links)
