The following pages link to Stephen T. Hedetniemi (Q251500):
Displaying 50 items.
- Irredundant and perfect neighbourhood sets in trees (Q1584343) (← links)
- The complexity of approximating MAPs for belief networks with bounded probabilities (Q1589640) (← links)
- On \(k\)-dependent domination (Q1598844) (← links)
- Maximal matching stabilizes in time \(O(m)\) (Q1607119) (← links)
- Rainbow disconnection in graphs (Q1656915) (← links)
- Client-server and cost effective sets in graphs (Q1713579) (← links)
- Distribution centers in graphs (Q1752461) (← links)
- Generalized subgraph-restricted matchings in graphs (Q1779490) (← links)
- Defending the Roman Empire---a new strategy (Q1810648) (← links)
- The subchromatic number of a graph (Q1823255) (← links)
- Nearly perfect sets in graphs (Q1842165) (← links)
- Total irredundance in graphs (Q1849917) (← links)
- \(H\)-forming sets in graphs (Q1868845) (← links)
- Minus domination in regular graphs (Q1910590) (← links)
- The algorithmic complexity of minus domination in graphs (Q1917346) (← links)
- Secondary and internal distances of sets in graphs. II (Q1928636) (← links)
- Sufficient conditions for a graph to be Hamiltonian (Q2265440) (← links)
- Domination equivalence in graphs (Q2369388) (← links)
- On \(ve\)-degrees and \(ev\)-degrees in graphs (Q2374155) (← links)
- Security in graphs (Q2381534) (← links)
- An anonymous self-stabilizing algorithm for 1-maximal independent set in trees (Q2390286) (← links)
- Quorum colorings of graphs (Q2443417) (← links)
- \([1,2]\)-sets in graphs (Q2446878) (← links)
- Analyzing graphs by degrees (Q2447514) (← links)
- On domination and reinforcement numbers in trees (Q2469996) (← links)
- Unsolved algorithmic problems on trees (Q2508406) (← links)
- Downhill domination in graphs (Q2509549) (← links)
- Graphs with forbidden subgraphs (Q2547895) (← links)
- Hereditary properties of raphs (Q2556340) (← links)
- An algorithm for partial Grundy number on trees (Q2576842) (← links)
- Broadcasts in graphs (Q2581560) (← links)
- Domination and independence subdivision numbers of graphs (Q2725191) (← links)
- (Q2799827) (← links)
- (Q2809930) (← links)
- (Q2811822) (← links)
- (Q2869348) (← links)
- (Q2876034) (← links)
- (Q2878210) (← links)
- (Q2895354) (← links)
- (Q2960958) (← links)
- Roman and Total Domination (Q2968700) (← links)
- Split Domination, Independence, and Irredundance in Graphs (Q2971222) (← links)
- (Q2971229) (← links)
- Edge Cut Domination, Irredundance, and Independence in Graphs (Q2971262) (← links)
- (Q3033783) (← links)
- (Q3059032) (← links)
- (Q3070232) (← links)
- (Q3089219) (← links)
- γ-graphs of graphs (Q3092684) (← links)
- (Q3118082) (← links)
