Pages that link to "Item:Q794174"
From MaRDI portal
The following pages link to Dominating sets for split and bipartite graphs (Q794174):
Displaying 50 items.
- Bounds on the bend number of split and cocomparability graphs (Q2322713) (← links)
- Bipartization of graphs (Q2334080) (← links)
- On the complexity of \(\{k\}\)-domination and \(k\)-tuple domination in graphs (Q2345849) (← links)
- Approximation algorithms for clique transversals on some graph classes (Q2346555) (← links)
- On secure domination in graphs (Q2348710) (← links)
- On some domination colorings of graphs (Q2399288) (← links)
- Dominator sequences in bipartite graphs (Q2404078) (← links)
- Broadcast domination and multipacking in strongly chordal graphs (Q2414458) (← links)
- On dominating sets whose induced subgraphs have a bounded diameter (Q2444556) (← links)
- Computing a minimum outer-connected dominating set for the class of chordal graphs (Q2444768) (← links)
- Faster algorithms for vertex partitioning problems parameterized by clique-width (Q2447760) (← links)
- On the complexity of dominating set problems related to the minimum all-ones problem (Q2456358) (← links)
- Some advances on the set covering polyhedron of circulant matrices (Q2636828) (← links)
- Monopolar graphs: complexity of computing classical graph parameters (Q2659081) (← links)
- On dominating set polyhedra of circular interval graphs (Q2659194) (← links)
- Domination and its variants in split graphs \(-\text{P}\) versus NPC dichotomy (Q2692638) (← links)
- On the convexity of paths of length two in undirected graphs (Q2839205) (← links)
- Inclusion/Exclusion Branching for Partial Dominating Set and Set Splitting (Q3058704) (← links)
- Vertex-Neighbor-Scattering Number of Bipartite Graphs (Q3186052) (← links)
- Algorithmic Aspects of Disjunctive Domination in Graphs (Q3196396) (← links)
- (Q3353058) (← links)
- (Q3408843) (← links)
- The Complexity of Dominating Set Reconfiguration (Q3449837) (← links)
- A note on domination in bipartite graphs (Q4435559) (← links)
- Algorithmic complexity of secure connected domination in graphs (Q4956219) (← links)
- Decremental Optimization of Dominating Sets Under the Reconfiguration Framework (Q5041181) (← links)
- Well-indumatched Trees and Graphs of Bounded Girth (Q5060441) (← links)
- (Q5092403) (← links)
- Vertex Deletion Problems on Chordal Graphs (Q5136314) (← links)
- Weighted Upper Edge Cover: Complexity and Approximability (Q5216282) (← links)
- Domination problems on P<sub>5</sub>-free graphs (Q5248877) (← links)
- Dominating Bipartite Subgraphs in Graphs (Q5316262) (← links)
- (Q5486641) (← links)
- A ZONAL ALGORITHM FOR CLUSTERING AN HOC NETWORKS (Q5696911) (← links)
- Algorithmic aspects of k-part degree restricted domination in graphs (Q5858166) (← links)
- (Q5863477) (← links)
- Dominating cliques in graphs (Q5896554) (← links)
- Exploring the complexity boundary between coloring and list-coloring (Q5896984) (← links)
- Total domination in interval graphs (Q5903263) (← links)
- Dominating cliques in graphs (Q5925264) (← links)
- The Neighborhood Polynomial of Chordal Graphs (Q6045410) (← links)
- Extension of some edge graph problems: standard, parameterized and approximation complexity (Q6048430) (← links)
- Parameterized complexity of multicut in weighted trees (Q6050131) (← links)
- Split total strong (weak) domination in bipolar fuzzy graph (Q6051988) (← links)
- Colouring a dominating set without conflicts: \(q\)-subset square colouring (Q6077071) (← links)
- Unique response Roman domination: complexity and algorithms (Q6088304) (← links)
- Edge deletion to tree-like graph classes (Q6124427) (← links)
- Grouped domination parameterized by vertex cover, twin cover, and beyond (Q6131196) (← links)
- Constrained Hitting Set and Steiner Tree in SCk and 2K2-free Graphs (Q6136471) (← links)
- Detour global domination for splitting graph (Q6174750) (← links)
