The following pages link to Michael A. Henning (Q186200):
Displaying 50 items.
- Properties of total domination edge-critical graphs (Q968121) (← links)
- A characterization of cubic graphs with paired-domination number three-fifths their order (Q968213) (← links)
- Erratum to: [``Local edge domination critical graphs'', Discrete Math. 161, No.\,1--3, 175--184 (1996; Zbl 0870.05035)] (Q968447) (← links)
- Vertices contained in all or in no minimum paired-dominating set of a tree (Q995930) (← links)
- The independence number in graphs of maximum degree three (Q998471) (← links)
- A survey of selected recent results on total domination in graphs (Q998491) (← links)
- A new upper bound on the total domination number of a graph (Q1010625) (← links)
- An upper bound on the domination number of a graph with minimum degree 2 (Q1011694) (← links)
- Total domination in graphs with given girth (Q1014823) (← links)
- On the ratios between packing and domination parameters of a graph (Q1025506) (← links)
- On total domination vertex critical graphs of high connectivity (Q1026168) (← links)
- Total domination in planar graphs of diameter two (Q1045014) (← links)
- A dedication to Professor Gary Chartrand (Q1045115) (← links)
- A survey of stratified domination in graphs (Q1045116) (← links)
- Remarks about disjoint dominating sets (Q1045182) (← links)
- An independent dominating set in the complement of a minimum dominating set of a tree (Q1049262) (← links)
- Principal common divisors of graphs (Q1209724) (← links)
- Graphs with large restrained domination number (Q1292850) (← links)
- Minus domination in graphs (Q1297430) (← links)
- Real and integer domination in graphs (Q1297432) (← links)
- On perfect neighborhood sets in graphs (Q1297450) (← links)
- Homogeneous embeddings of cycles in graphs (Q1299993) (← links)
- Queens graphs (Q1304808) (← links)
- Extremal results on defective colorings of graphs (Q1318803) (← links)
- The diversity of domination (Q1356420) (← links)
- Local edge domination critical graphs (Q1356421) (← links)
- Opinion functions on trees (Q1356450) (← links)
- Frames of cycles and directed cycles (Q1366909) (← links)
- Some general aspects of the framing number of a digraph (Q1383372) (← links)
- Nordhaus--Gaddum bounds for independent domination (Q1398273) (← links)
- Graphs of order \(n\) with locating-chromatic number \(n-1\) (Q1402068) (← links)
- Defending the Roman Empire from multiple attacks (Q1408869) (← links)
- Stratification and domination in graphs (Q1412664) (← links)
- Changing and unchanging domination: A classification (Q1415545) (← links)
- On upper domination Ramsey numbers for graphs. (Q1421516) (← links)
- Global defensive alliances in graphs (Q1422134) (← links)
- Signed total domination in graphs. (Q1427473) (← links)
- Graphs with least domination number three-fifths their order (Q1567273) (← links)
- Bipartite Ramsey numbers and Zarankiewicz numbers (Q1567662) (← links)
- Star-path bipartite Ramsey numbers (Q1584252) (← links)
- Packing in trees (Q1584274) (← links)
- A characterization of \(i\)-excellent trees (Q1598814) (← links)
- Signed 2-independence in graphs (Q1613437) (← links)
- Restricted domination in graphs (Q1613539) (← links)
- On upper transversals in 3-uniform hypergraphs (Q1627202) (← links)
- Not-all-equal 3-SAT and 2-colorings of 4-regular 4-uniform hypergraphs (Q1637144) (← links)
- Domination parameters of a graph and its complement (Q1692643) (← links)
- Hereditary equality of domination and exponential domination (Q1692649) (← links)
- On upper bounds for the independent transversal domination number (Q1693131) (← links)
- Perfect Roman domination in trees (Q1693150) (← links)