Pages that link to "Item:Q1099628"
From MaRDI portal
The following pages link to The NP-completeness of Steiner tree and dominating set for chordal bipartite graphs (Q1099628):
Displaying 22 items.
- Connected Domination (Q3384607) (← links)
- (Q3731620) (← links)
- Linear separation of connected dominating sets in graphs (Q5225055) (← links)
- Domination problems on P<sub>5</sub>-free graphs (Q5248877) (← links)
- A linear time algorithm to compute a minimum restrained dominating set in proper interval graphs (Q5261054) (← links)
- Algorithmic aspects of k-part degree restricted domination in graphs (Q5858166) (← links)
- Combinatorics and algorithms for quasi-chain graphs (Q5918620) (← links)
- Combinatorics and algorithms for quasi-chain graphs (Q5925628) (← links)
- On the computational difficulty of the terminal connection problem (Q6041044) (← links)
- On a countable family of boundary graph classes for the dominating set problem (Q6054225) (← links)
- Unique response Roman domination: complexity and algorithms (Q6088304) (← links)
- On convexity in split graphs: complexity of Steiner tree and domination (Q6123388) (← links)
- Star covers and star partitions of double-split graphs (Q6124494) (← links)
- Constrained Hitting Set and Steiner Tree in SCk and 2K2-free Graphs (Q6136471) (← links)
- Some new algorithmic results on co-secure domination in graphs (Q6190005) (← links)
- On star partition of split graphs (Q6547833) (← links)
- Star covers and star partitions of cographs and butterfly-free graphs (Q6547835) (← links)
- Roman \(\{3\}\)-domination in graphs: complexity and algorithms (Q6558691) (← links)
- On maximal Roman domination in graphs: complexity and algorithms (Q6593946) (← links)
- Optimal local identifying and local locating-dominating codes (Q6614544) (← links)
- A closer look at Hamiltonicity and domination through the lens of diameter and convexity (Q6634506) (← links)
- Approximation hardness of domination problems on generalized convex graphs (Q6664063) (← links)
