The following pages link to Michael A. Henning (Q186200):
Displaying 50 items.
- Disjunctive total domination in graphs (Q266033) (← links)
- Induced 2-regular subgraphs in \(k\)-chordal cubic graphs (Q266935) (← links)
- Total dominating sequences in graphs (Q267175) (← links)
- A characterization of hypergraphs with large domination number (Q274700) (← links)
- Largest domination number and smallest independence number of forests with given degree sequence (Q277645) (← links)
- Game total domination for cycles and paths (Q284829) (← links)
- Locating-total dominating sets in twin-free graphs: a conjecture (Q311495) (← links)
- Bounds on the game transversal number in hypergraphs (Q326647) (← links)
- Location-domination in line graphs (Q329538) (← links)
- Matchings, path covers and domination (Q329554) (← links)
- Trees with large \(m\)-eternal domination number (Q335333) (← links)
- A note on non-dominating set partitions in graphs (Q339496) (← links)
- Domination versus independent domination in cubic graphs (Q385388) (← links)
- Induced matchings in subcubic graphs without short cycles (Q393187) (← links)
- Relating the annihilation number and the 2-domination number of a tree (Q394342) (← links)
- A new lower bound for the total domination number in graphs proving a Graffiti.pc conjecture (Q400496) (← links)
- A maximum degree theorem for diameter-2-critical graphs (Q403217) (← links)
- A new lower bound on the independence number of a graph and applications (Q405126) (← links)
- Total transversals and total domination in uniform hypergraphs (Q405218) (← links)
- Improved bounds on the domination number of a tree (Q406327) (← links)
- Directed domination in oriented graphs (Q423913) (← links)
- Multiple factor Nordhaus-Gaddum type results for domination and total domination (Q423926) (← links)
- On \(\alpha\)-total domination in graphs (Q423927) (← links)
- Hypergraphs with large transversal number and with edge sizes at least four (Q424115) (← links)
- A characterization of diameter-2-critical graphs with no antihole of length four (Q424139) (← links)
- Independent sets and matchings in subcubic graphs (Q427833) (← links)
- A characterization of diameter-2-critical graphs whose complements are diamond-free (Q442211) (← links)
- Locating-total domination in graphs (Q442212) (← links)
- Hypergraphs with large domination number and with edge sizes at least three (Q444441) (← links)
- Fair domination in graphs (Q449132) (← links)
- Locating-total domination in claw-free cubic graphs (Q456648) (← links)
- An improved lower bound on the independence number of a graph (Q477342) (← links)
- Simultaneous domination in graphs (Q489305) (← links)
- Total domination edge critical graphs with total domination number three and many dominating pairs (Q497305) (← links)
- Total version of the domination game (Q497340) (← links)
- Progress on the Murty-Simon conjecture on diameter-2 critical graphs: a survey (Q498431) (← links)
- Induced cycles in graphs (Q503635) (← links)
- (Total) domination in prisms (Q510330) (← links)
- Italian domination in trees (Q516889) (← links)
- Domination game: extremal families for the 3/5-conjecture for forests (Q521754) (← links)
- On the existence of \(k\)-partite or \(K_p\)-free total domination edge-critical graphs (Q539864) (← links)
- Maximal independent sets in minimum colorings (Q539867) (← links)
- Hamiltonicity of \(k\)-traceable graphs (Q540049) (← links)
- Which trees have a differentiating-paired dominating set? (Q543501) (← links)
- An extremal problem for total domination stable graphs upon edge removal (Q548282) (← links)
- (Q592262) (redirect page) (← links)
- Total domination critical and stable graphs upon edge removal (Q602674) (← links)
- Disjoint dominating and total dominating sets in graphs (Q602677) (← links)
- A short proof of a result on a Vizing-like problem for integer total domination (Q604746) (← links)
- Total domination stable graphs upon edge addition (Q607001) (← links)
