The following pages link to (Q4108373):
Displaying 43 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)
- Some upper bounds for the product of the domination number and the chromatic number of a graph (Q685554) (← links)
- A sharp upper bound on the least signless Laplacian eigenvalue using domination number (Q742633) (← links)
- Bibliography on domination in graphs and some basic definitions of domination parameters (Q810066) (← links)
- Upper bounds for \(\alpha \)-domination parameters (Q844230) (← links)
- Domination number and Laplacian eigenvalue distribution (Q901155) (← links)
- Estimations for the domination number of a graph (Q912870) (← 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 number and neighbourhood conditions (Q1296973) (← links)
- 2-connected graphs with small 2-connected dominating sets. (Q1402083) (← links)
- Domination in commuting graph and its complement (Q1696086) (← links)
- Pairs of disjoint dominating sets and the minimum degree of graphs (Q1959712) (← links)
- Improved bounds on the \(k\)-tuple (Roman) domination number of a graph (Q2121485) (← links)
- Bounds on domination parameters in graphs: a brief survey (Q2151205) (← links)
- New probabilistic upper bounds on the domination number of a graph (Q2318775) (← links)
- On general frameworks and threshold functions for multiple domination (Q2352076) (← links)
- On upper bounds for multiple domination numbers of graphs (Q2444571) (← links)
- New bounds on the \(k\)-domination number and the \(k\)-tuple domination number (Q2463933) (← links)
- A generalised upper bound for the \(k\)-tuple domination number (Q2470457) (← links)
- Domination number of graphs with minimum degree five (Q2656332) (← links)
- Upper bounds on the \(k\)-tuple (Roman) domination number of a graph (Q2657089) (← links)
- Multiple Domination (Q3384609) (← links)
- On domination-type invariants of Fibonacci cubes and hypercubes (Q4577877) (← links)
- Independent dominating sets in graphs of girth five (Q4993127) (← links)
- Domination type parameters of Pell graphs (Q5056829) (← links)
- Partial domination - the isolation number of a graph (Q5162046) (← links)
- Pebbling Graphs of Fixed Diameter (Q5417824) (← links)
- On restricted domination in graphs (Q5433519) (← links)
- (Q6111721) (← links)
