The following pages link to Michael A. Henning (Q186200):
Displaying 50 items.
- Restrained domination in trees (Q1969775) (← links)
- Independent domination in bipartite cubic graphs (Q2000581) (← links)
- Total forcing versus total domination in cubic graphs (Q2011113) (← links)
- A note on fractional disjoint transversals in hypergraphs (Q2012518) (← links)
- Edge weighting functions on semitotal dominating sets (Q2014223) (← links)
- Paired versus double domination in \(K_{1,r}\)-free graphs (Q2015806) (← links)
- Bounds on the semipaired domination number of graphs with minimum degree at least two (Q2025082) (← links)
- Zero forcing versus domination in cubic graphs (Q2025087) (← links)
- Partitioning the vertices of a cubic graph into two total dominating sets (Q2030435) (← links)
- A characterization of graphs with given maximum degree and smallest possible matching number (Q2032746) (← links)
- Matching and edge-connectivity in graphs with given maximum degree (Q2032857) (← links)
- On the domination number of graphs with minimum degree six (Q2032873) (← links)
- A new upper bound on the total domination number in graphs with minimum degree six (Q2043347) (← links)
- Independent domination subdivision in graphs (Q2045365) (← links)
- Affine planes and transversals in 3-uniform linear hypergraphs (Q2045381) (← links)
- Bounds on the paired domination number of graphs with minimum degree at least three (Q2060245) (← links)
- A characterization of graphs with given maximum degree and smallest possible matching number. II (Q2065903) (← links)
- Local metric dimension for graphs with small clique numbers (Q2075516) (← links)
- Domination versus total domination in claw-free cubic graphs (Q2075530) (← links)
- Upper total domination in claw-free cubic graphs (Q2084795) (← links)
- Independent domination in outerplanar graphs (Q2104922) (← links)
- Unique minimum semipaired dominating sets in trees (Q2107740) (← links)
- On a conjecture about the local metric dimension of graphs (Q2111072) (← links)
- A generalization of Petersen's matching theorem (Q2111920) (← links)
- Triangles and (total) domination in subcubic graphs (Q2115140) (← links)
- An improved upper bound on the independent domination number in cubic graphs of girth at least six (Q2115169) (← links)
- A classification of cactus graphs according to their domination number (Q2118249) (← links)
- Improved bounds on the \(k\)-tuple (Roman) domination number of a graph (Q2121485) (← links)
- Graph and network theory. An applied approach using Mathematica (Q2139899) (← links)
- Approximation algorithm and hardness results for defensive domination in graphs (Q2149875) (← links)
- Bounds on domination parameters in graphs: a brief survey (Q2151205) (← links)
- Paired domination in trees (Q2159733) (← links)
- Total forcing sets and zero forcing sets in trees (Q2175233) (← links)
- Equating \(\kappa\) maximum degrees in graphs without short cycles (Q2175241) (← links)
- Trees with unique minimum semitotal dominating sets (Q2175800) (← links)
- Domination versus independent domination in graphs of small regularity (Q2182182) (← links)
- Independent domination, colorings and the fractional idomatic number of a graph (Q2185446) (← links)
- Maker-breaker total domination game (Q2185735) (← links)
- Transversals in linear uniform hypergraphs (Q2191126) (← links)
- Total domination cover rubbling (Q2192071) (← links)
- Domination versus edge domination (Q2197443) (← links)
- 2-limited broadcast domination in subcubic graphs (Q2197488) (← links)
- Graphs with large Italian domination number (Q2210211) (← links)
- Bounding and approximating minimum maximal matchings in regular graphs (Q2222947) (← links)
- Restrained domination in self-complementary graphs (Q2227117) (← links)
- Lower bounds on Tuza constants for transversals in linear uniform hypergraphs (Q2231740) (← links)
- Connected domination critical graphs with a block having maximum number of cut vertices (Q2243262) (← links)
- On a conjecture of Murty and Simon on diameter 2-critical graphs (Q2275449) (← links)
- Algorithmic aspects of upper paired-domination in graphs (Q2283034) (← links)
- Bounds on upper transversals in hypergraphs (Q2292129) (← links)
