The following pages link to (Q4108373):
Displaying 20 items.
- Algorithms and almost tight results for 3-colorability of small diameter graphs (Q261372) (← links)
- Improved upper bounds on the domination number of graphs with minimum degree at least five (Q292247) (← links)
- Rainbow edge-coloring and rainbow domination (Q383777) (← links)
- Upper bounds on the balanced \(\langle \mathbf{r}, \mathbf{s} \rangle\)-domination number of a graph (Q477351) (← links)
- A study of 3-arc graphs (Q628319) (← links)
- On roman, global and restrained domination in graphs (Q659738) (← links)
- \(k\)-domination and \(k\)-independence in graphs: A survey (Q659765) (← links)
- A greedy partition lemma for directed domination (Q665996) (← links)
- A sharp upper bound on the least signless Laplacian eigenvalue using domination number (Q742633) (← links)
- Upper bounds for \(\alpha \)-domination parameters (Q844230) (← links)
- Domination number and Laplacian eigenvalue distribution (Q901155) (← links)
- The upper bound on \(k\)-tuple domination numbers of graphs (Q925036) (← links)
- The \(k\)-tuple domination number revisited (Q952712) (← links)
- A sharp upper bound on algebraic connectivity using domination number (Q967504) (← links)
- On the geodetic and geodetic domination numbers of a graph (Q982620) (← links)
- Domination in bipartite graphs (Q998499) (← links)
- Efficiency in exponential time for domination-type problems (Q1003475) (← links)
- Minimum partition of an independence system into independent sets (Q1013303) (← links)
- Upper bounds on the \(k\)-domination number and the \(k\)-Roman domination number (Q1028141) (← links)
- Domination in commuting graph and its complement (Q1696086) (← links)
