The following pages link to Stephen T. Hedetniemi (Q251500):
Displaying 50 items.
- Roman \(\{2 \}\)-domination (Q266795) (← links)
- Neighborhood-restricted \([\leq 2]\)-achromatic colorings (Q290097) (← links)
- Very cost effective bipartitions in graphs (Q322000) (← links)
- Double Roman domination (Q335328) (← links)
- A self-stabilizing algorithm for optimally efficient sets in graphs (Q456061) (← links)
- A theorem of Ore and self-stabilizing algorithms for disjoint minimal dominating sets (Q501004) (← links)
- Restricted optimal pebbling and domination in graphs (Q512538) (← links)
- Matchings and transversals in hypergraphs, domination and independence in trees (Q599067) (← links)
- Linear algorithms for edge-coloring trees and unicyclic graphs (Q600259) (← links)
- Matchability and \(k\)-maximal matchings (Q617892) (← links)
- Secondary and internal distances of sets in graphs (Q624153) (← links)
- A note on \(\gamma\)-graphs (Q647231) (← links)
- Bounds on weak Roman and 2-rainbow domination numbers (Q741531) (← links)
- On the computational complexity of upper fractional domination (Q753848) (← links)
- (Q804599) (redirect page) (← links)
- Gallai theorems for graphs, hypergraphs, and set systems (Q804601) (← links)
- Introduction to ``Topics on Domination'' (Q804605) (← links)
- Bibliography on domination in graphs and some basic definitions of domination parameters (Q810066) (← links)
- Domination number and Laplacian eigenvalue distribution (Q901155) (← links)
- Distance-\(k\) knowledge in self-stabilizing algorithms (Q930908) (← links)
- Secondary domination in graphs (Q1011873) (← links)
- On the Wimer method for designing edge-based algorithms (Q1011875) (← links)
- Linear time self-stabilizing colorings (Q1014432) (← links)
- Powerful alliances in graphs (Q1025468) (← links)
- (Q1065019) (redirect page) (← links)
- A note on total domination (Q1065020) (← links)
- On the diagonal queens domination problem (Q1073797) (← links)
- A linear algorithm for finding a minimum dominating set in a cactus (Q1078205) (← links)
- Centering a spanning tree of a biconnected graph (Q1123632) (← links)
- (Q1219555) (redirect page) (← links)
- A linear algorithm for the domination number of a tree (Q1219556) (← links)
- Disjoint independent dominating sets in graphs (Q1240740) (← links)
- Disjoint cliques in regular graphs of degree seven and eight (Q1242172) (← links)
- A linear algorithm for disjoint matchings in trees (Q1245850) (← links)
- Linear algorithms on recursive representations of trees (Q1254104) (← links)
- Minimum broadcast graphs (Q1256494) (← links)
- Minus domination in graphs (Q1297430) (← links)
- On perfect neighborhood sets in graphs (Q1297450) (← links)
- Restrained domination in graphs (Q1301655) (← links)
- Periodic gossiping on trees (Q1339893) (← links)
- On weakly connected domination in graphs (Q1356466) (← links)
- \(k\)-path partitions in trees (Q1377668) (← links)
- Using maximality and minimality conditions to construct inequality chains (Q1377679) (← links)
- On the equality of the partial Grundy and upper ochromatic numbers of graphs (Q1415544) (← links)
- Global defensive alliances in graphs (Q1422134) (← links)
- Roman domination in graphs. (Q1427467) (← links)
- Iterated colorings of graphs. (Q1427472) (← links)
- The even adjacency split problem for graphs (Q1566571) (← links)
- Extremal graphs for inequalities involving domination parameters (Q1567259) (← links)
- Acyclic domination (Q1579559) (← links)
