The following pages link to Johannes H. Hattingh (Q281802):
Displayed 50 items.
- Equality in a bound that relates the size and the restrained domination number of a graph (Q281803) (← links)
- Nordhaus-Gaddum results for the induced path number of a graph when neither the graph nor its complement contains isolates (Q293628) (← links)
- Total domination in maximal outerplanar graphs (Q516883) (← links)
- A note on the total outer-connected domination number of a tree (Q547559) (← links)
- Bounds on the total restrained domination number of a graph (Q604651) (← links)
- An upper bound on the total restrained domination number of a tree (Q604747) (← links)
- Restrained domination in cubic graphs (Q719025) (← links)
- Some bistar bipartite Ramsey numbers (Q742632) (← links)
- Total restrained domination in trees (Q879341) (← links)
- Total domination in maximal outerplanar graphs. II. (Q897314) (← links)
- On the domination number of Hamiltonian graphs with minimum degree six (Q952720) (← links)
- An upper bound for the restrained domination number of a graph with minimum degree at least two in terms of order and minimum degree (Q967326) (← links)
- Bounds relating the weakly connected domination number to the total domination number and the matching number (Q967362) (← links)
- Restrained domination in claw-free graphs with minimum degree at least two (Q968212) (← links)
- Restrained bondage in graphs (Q998423) (← links)
- A characterization of \(\lambda _{d,1}\)-minimal trees and other attainable classes (Q1025490) (← links)
- Restrained domination in graphs (Q1301655) (← links)
- On weakly connected domination in graphs (Q1356466) (← links)
- Minus \(k\)-subdomination in graphs. II (Q1363694) (← links)
- Item:Q281802 (redirect page) (← links)
- Using maximality and minimality conditions to construct inequality chains (Q1377679) (← links)
- The signed and minus \(k\)-subdomination numbers of comets (Q1382823) (← links)
- Star-path bipartite Ramsey numbers (Q1584252) (← links)
- Some multicolor bipartite Ramsey numbers involving cycles and a small number of colors (Q1709532) (← links)
- Maximum sizes of graphs with given domination parameters (Q1827704) (← links)
- Majority domination in graphs (Q1842153) (← links)
- On parameters related to strong and weak domination in graphs (Q1850037) (← links)
- A Nordhaus-Gaddum-type result for the induced path number (Q1928519) (← links)
- Nordhaus-Gaddum results for the sum of the induced path number of a graph and its complement (Q1941298) (← links)
- Restrained domination in trees (Q1969775) (← links)
- The product of the restrained domination numbers of a graph and its complement (Q2452393) (← links)
- On equality in an upper bound for the restrained and total domination numbers of a graph (Q2461210) (← links)
- Nordhaus-Gaddum results for restrained domination and total restrained domination in graphs (Q2469984) (← links)
- Trees with equal domination and restrained domination numbers (Q2494314) (← links)
- Augmenting a graph of minimum degree 2 to have two disjoint total dominating sets (Q2570105) (← links)
- On weakly connected domination in graphs. II. (Q2581406) (← links)
- (Q2708253) (← links)
- (Q2713615) (← links)
- (Q2713632) (← links)
- (Q2713647) (← links)
- (Q2715936) (← links)
- (Q2725013) (← links)
- (Q2760993) (← links)
- (Q2878220) (← links)
- (Q2895421) (← links)
- The mixed irredundant Ramsey numbers<i>t</i>(3, 7) = 18 and<i>t</i>(3, 8) = 22 (Q2968645) (← links)
- (Q3004141) (← links)
- (Q3059011) (← links)
- (Q3070295) (← links)
- (Q3094567) (← links)