The following pages link to (Q4529495):
Displayed 12 items.
- \(\gamma\)-excellent, critically dominated, end-dominated, and dot-critical trees are equivalent (Q868329) (← links)
- On independent \([1, 2]\)-sets in trees (Q1649903) (← links)
- On bondage numbers of graphs: a survey with some comments (Q1953664) (← links)
- Changing and unchanging of the domination number of a graph: path addition numbers (Q2227098) (← links)
- Changing and unchanging of the domination number of a graph (Q2519817) (← links)
- On weakly connected domination in graphs. II. (Q2581406) (← links)
- On \(\alpha\)-excellent graphs (Q2683166) (← links)
- Characterization of Total Very Excellent Trees (Q3449426) (← links)
- Roman domination excellent graphs: trees (Q4635024) (← links)
- Every γ-excellent, γ-flexible graph is γ<i><sub>bi</sub></i>-excellent (Q4821806) (← links)
- (Q5076839) (← links)
- Excellent graphs with respect to domination: subgraphs induced by minimum dominating sets (Q5862679) (← links)