Pages that link to "Item:Q918703"
From MaRDI portal
The following pages link to Domination in convex and chordal bipartite graphs (Q918703):
Displaying 50 items.
- Total domination and transformation (Q287166) (← links)
- Circular convex bipartite graphs: feedback vertex sets (Q300230) (← links)
- Complexity of domination, Hamiltonicity and treewidth for tree convex bipartite graphs (Q328696) (← links)
- Minimum paired-dominating set in chordal bipartite graphs and perfect elimination bipartite graphs (Q386432) (← links)
- Graph classes with structured neighborhoods and algorithmic applications (Q392023) (← links)
- A decidability result for the dominating set problem (Q410736) (← links)
- On orthogonal ray graphs (Q602682) (← links)
- Edge domination on bipartite permutation graphs and cotriangulated graphs (Q672265) (← links)
- Linear-time algorithm for the paired-domination problem in convex bipartite graphs (Q692884) (← links)
- Polar graphs and maximal independent sets (Q860455) (← links)
- Paths in interval graphs and circular arc graphs (Q1210553) (← links)
- On the complexity of the k-chain subgraph cover problem (Q1275070) (← links)
- Independent domination in finitely defined classes of graphs (Q1399990) (← links)
- The bottleneck independent domination on the classes of bipartite graphs and block graphs. (Q1429835) (← links)
- Domination in some subclasses of bipartite graphs (Q1630774) (← links)
- Mobile versus point guards (Q1716007) (← links)
- Algorithmic aspects of semitotal domination in graphs (Q1731849) (← links)
- On total \(f\)-domination: polyhedral and algorithmic results (Q1732100) (← links)
- The Hamiltonian circuit problem for circle graphs is NP-complete (Q1823687) (← links)
- Chordal bipartite graphs of bounded tree- and clique-width (Q1827785) (← links)
- Right angle free subsets in the plane (Q1895818) (← links)
- Decision and approximation complexity for identifying codes and locating-dominating sets in restricted graph classes (Q2018540) (← links)
- Differentiating-total domination: approximation and hardness results (Q2034786) (← links)
- Linear algorithms for red and blue domination in convex bipartite graphs (Q2115838) (← links)
- Induced star partition of graphs (Q2161236) (← links)
- Steiner tree in \(k\)-star caterpillar convex bipartite graphs: a dichotomy (Q2165280) (← links)
- Global total \(k\)-domination: approximation and hardness results (Q2216425) (← links)
- Independent domination in finitely defined classes of graphs: polynomial algorithms (Q2255037) (← links)
- The complexity of dissociation set problems in graphs (Q2275943) (← links)
- Integer linear programming models for the weighted total domination problem (Q2279352) (← links)
- Independent domination versus weighted independent domination (Q2294440) (← links)
- Semitotal domination: new hardness results and a polynomial-time algorithm for graphs of bounded mim-width (Q2304548) (← links)
- Tractable connected domination for restricted bipartite graphs (Q2354310) (← links)
- More results on weighted independent domination (Q2410364) (← links)
- NP-hard graph problems and boundary classes of graphs (Q2465640) (← links)
- Circular Convex Bipartite Graphs: Feedback Vertex Set (Q2867126) (← links)
- Graph Classes with Structured Neighborhoods and Algorithmic Applications (Q3104764) (← links)
- COMPLEXITY OF CERTAIN FUNCTIONAL VARIANTS OF TOTAL DOMINATION IN CHORDAL BIPARTITE GRAPHS (Q3166754) (← links)
- On Distance-d Independent Set and Other Problems in Graphs with “few” Minimal Separators (Q3181057) (← links)
- Tree-Width and Optimization in Bounded Degree Graphs (Q3508553) (← links)
- Weighted Upper Edge Cover: Complexity and Approximability (Q5216282) (← links)
- Strong Chordality of Graphs with Possible Loops (Q5854465) (← links)
- Combinatorics and algorithms for quasi-chain graphs (Q5918620) (← links)
- Combinatorics and algorithms for quasi-chain graphs (Q5925628) (← 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)
- On star partition of split graphs (Q6547833) (← links)
- Star covers and star partitions of cographs and butterfly-free graphs (Q6547835) (← links)
- Open packing in \(H\)-free graphs and subclasses of split graphs (Q6547836) (← links)
- Total domination, separated-cluster, CD-coloring: algorithms and hardness (Q6547920) (← links)
