The following pages link to Michael A. Henning (Q186200):
Displaying 50 items.
- Total domination stability in graphs (Q1693151) (← links)
- A note on domination and total domination in prisms (Q1698053) (← links)
- The matcher game played in graphs (Q1701097) (← links)
- The 4/5 upper bound on the game total domination number (Q1705814) (← links)
- Total domination versus domination in cubic graphs (Q1706439) (← links)
- Total domination versus paired-domination in regular graphs (Q1708402) (← links)
- Infinite families of circular and Möbius ladders that are total domination game critical (Q1714056) (← links)
- Cutting lemma and union lemma for the domination game (Q1727804) (← links)
- On the total forcing number of a graph (Q1730228) (← links)
- Algorithmic aspects of semitotal domination in graphs (Q1731849) (← links)
- A characterization of double Roman trees (Q1735679) (← links)
- Perfect Italian domination in trees (Q1741510) (← links)
- Relating domination, exponential domination, and porous exponential domination (Q1751208) (← links)
- Essential upper bounds on the total domination number (Q1752594) (← links)
- Bounds on the connected forcing number of a graph (Q1756082) (← links)
- Total forcing and zero forcing in claw-free cubic graphs (Q1756105) (← links)
- Restricted total domination in graphs (Q1763333) (← links)
- On the total domination number of Cartesian products of graphs (Q1777233) (← links)
- Game total domination critical graphs (Q1801040) (← links)
- \(k\)-broadcast domination and \(k\)-multipacking (Q1801065) (← links)
- Defending the Roman Empire---a new strategy (Q1810648) (← links)
- Inequalities relating domination parameters in cubic graphs (Q1815314) (← links)
- The average connectivity of a digraph (Q1827842) (← links)
- Majority domination in graphs (Q1842153) (← links)
- Total irredundance in graphs (Q1849917) (← links)
- Total domination supercritical graphs with respect to relative complements (Q1850074) (← links)
- Vertices contained in all or in no minimum total dominating set of a tree (Q1861240) (← links)
- Strong equality of domination parameters in trees (Q1861245) (← links)
- Matching transformation graphs of cubic bipartite plane graphs (Q1868835) (← links)
- \(H\)-forming sets in graphs (Q1868845) (← links)
- Total domination excellent trees (Q1869221) (← links)
- Total domination subdivision numbers of trees (Q1887637) (← links)
- Stratification and domination in graphs. II (Q1887638) (← links)
- The diameter of total domination vertex critical graphs (Q1887647) (← links)
- Irredundance perfect graphs (Q1896349) (← links)
- On \(n\)th order degree regular trees (Q1901617) (← links)
- Minus domination in regular graphs (Q1910590) (← links)
- The algorithmic complexity of minus domination in graphs (Q1917346) (← links)
- An algorithm to find two distance domination parameters in a graph (Q1917347) (← links)
- An improved upper bound on the total restrained domination number in cubic graphs (Q1926030) (← links)
- Girth and total domination in graphs (Q1926051) (← links)
- Total domination and matching numbers in graphs with all vertices in triangles (Q1928455) (← links)
- \(k\)-tuple total domination in cross products of graphs (Q1928523) (← links)
- On the independent domination number of regular graphs (Q1929752) (← links)
- Relating the annihilation number and the total domination number of a tree (Q1932455) (← links)
- Independent domination in graphs: A survey and recent results (Q1942046) (← links)
- Edge lifting and total domination in graphs (Q1945695) (← links)
- Hypergraphs with large transversal number (Q1946666) (← links)
- Open packing, total domination, and the \(P_3\)-Radon number (Q1947007) (← links)
- Identifying vertex covers in graphs (Q1953340) (← links)
