Dominating sets for split and bipartite graphs
From MaRDI portal
Publication:794174
Recommendations
Cites work
- R -Domination in Graphs
- A linear algorithm for the domination number of a tree
- Contributions to the theory of domination, independence and irredundance in graphs
- Disjoint independent dominating sets in graphs
- Dominating sets and domatic number of circular arc graphs
- Dominating Sets in Chordal Graphs
- Graph-theoretic parameters concerning domination, independence, and irredundance
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 3674114 (Why is no real title available?)
- scientific article; zbMATH DE number 3758364 (Why is no real title available?)
- scientific article; zbMATH DE number 3596896 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3299758 (Why is no real title available?)
- On domination and independent domination numbers of a graph
- Optimum domination in weighted trees
- Total domination in graphs
- Towards a theory of domination in graphs
Cited in
(only showing first 100 items - show all)- The NP-completeness of Steiner tree and dominating set for chordal bipartite graphs
- Dominating sets in perfect graphs
- On minimum dominating sets with minimum intersection
- Representations of graphs and networks (coding, layouts and embeddings)
- On the algorithmic complexity of twelve covering and independence parameters of graphs
- The geodetic number of a graph
- One-node cutsets and the dominating set polytope
- The even adjacency split problem for graphs
- Domination in some subclasses of bipartite graphs
- And/or-convexity: a graph convexity based on processes and deadlock models
- Algorithm complexity of neighborhood total domination and \((\rho,\gamma_{\mathrm{nt}})\)-graphs
- The complexity of secure domination problem in graphs
- On the geodetic number of complementary prisms
- Vertex deletion problems on chordal graphs
- Secure total domination in graphs: bounds and complexity
- Right angle free subsets in the plane
- Algorithmic aspects of the generalized clique-transversal problem on chordal graphs
- Paired-domination problem on distance-hereditary graphs
- Decision and approximation complexity for identifying codes and locating-dominating sets in restricted graph classes
- Dominating sets reconfiguration under token sliding
- Algorithmic aspects of secure connected domination in graphs
- Coloring a dominating set without conflicts: \(q\)-subset square coloring
- Well-partitioned chordal graphs
- Reducing the domination number of graphs via edge contractions and vertex deletions
- The numerical invariants concerning the total domination for generalized Petersen graphs
- Structural domination and coloring of some ( P₇ , C₇)-free graphs
- The complexity of the defensive domination problem in special graph classes
- Vector domination in split-indifference graphs
- Layered graphs: applications and algorithms
- Semitotal domination: new hardness results and a polynomial-time algorithm for graphs of bounded mim-width
- Bounds on the bend number of split and cocomparability graphs
- Bipartization of graphs
- On the complexity of \(\{k\}\)-domination and \(k\)-tuple domination in graphs
- Approximation algorithms for clique transversals on some graph classes
- On secure domination in graphs
- On some domination colorings of graphs
- Dominator sequences in bipartite graphs
- Broadcast domination and multipacking in strongly chordal graphs
- On dominating sets whose induced subgraphs have a bounded diameter
- Computing a minimum outer-connected dominating set for the class of chordal graphs
- Faster algorithms for vertex partitioning problems parameterized by clique-width
- On the complexity of dominating set problems related to the minimum all-ones problem
- Some advances on the set covering polyhedron of circulant matrices
- Monopolar graphs: complexity of computing classical graph parameters
- On dominating set polyhedra of circular interval graphs
- Domination and its variants in split graphs \(-\text{P}\) versus NPC dichotomy
- On the convexity of paths of length two in undirected graphs
- Computing role assignments of split graphs
- \((1, j)\)-set problem in graphs
- Inclusion/Exclusion Branching for Partial Dominating Set and Set Splitting
- Vertex-neighbor-scattering number of bipartite graphs
- Algorithmic aspects of disjunctive domination in graphs
- A complexity dichotomy and a new boundary class for the dominating set problem
- scientific article; zbMATH DE number 4202309 (Why is no real title available?)
- scientific article; zbMATH DE number 4204394 (Why is no real title available?)
- scientific article; zbMATH DE number 5072535 (Why is no real title available?)
- Graphs with maximal induced matchings of the same size
- The complexity of dominating set reconfiguration
- A decidability result for the dominating set problem
- On graphs for which the connected domination number is at most the total domination number
- A note on domination in bipartite graphs
- scientific article; zbMATH DE number 1463390 (Why is no real title available?)
- Independent dominating set problem revisited
- Algorithmic complexity of secure connected domination in graphs
- On the complexity of the minimum domination problem restricted by forbidden induced subgraphs of small size
- Decremental Optimization of Dominating Sets Under the Reconfiguration Framework
- Well-indumatched Trees and Graphs of Bounded Girth
- Reducing the domination number of graphs via edge contractions
- Restricted optimal pebbling and domination in graphs
- Vertex deletion problems on chordal graphs
- The complexity of dominating set reconfiguration
- Domination in some subclasses of bipartite graphs
- Weighted upper edge cover: complexity and approximability
- Domination problems on \(P_{5}\)-free graphs
- scientific article; zbMATH DE number 2204179 (Why is no real title available?)
- Dominating Bipartite Subgraphs in Graphs
- The algorithmic complexity of mixed domination in graphs
- scientific article; zbMATH DE number 5052323 (Why is no real title available?)
- A ZONAL ALGORITHM FOR CLUSTERING AN HOC NETWORKS
- Algorithmic aspects of k-part degree restricted domination in graphs
- Note on the domination number of graphs with forbidden cycles of lengths not divisible by 3
- Dominating cliques in graphs
- Exploring the complexity boundary between coloring and list-coloring
- Total domination in interval graphs
- Dominating cliques in graphs
- The Neighborhood Polynomial of Chordal Graphs
- Extension of some edge graph problems: standard, parameterized and approximation complexity
- Parameterized complexity of multicut in weighted trees
- Split total strong (weak) domination in bipolar fuzzy graph
- Broadcasting in split graphs
- Colouring a dominating set without conflicts: \(q\)-subset square colouring
- Unique response Roman domination: complexity and algorithms
- Algorithmic aspects of certified domination in graphs
- Edge deletion to tree-like graph classes
- Grouped domination parameterized by vertex cover, twin cover, and beyond
- Complexity results on cosecure domination in graphs
- Constrained Hitting Set and Steiner Tree in SCk and 2K2-free Graphs
- Detour global domination for splitting graph
- Cosecure domination: hardness results and algorithms
- Some new algorithmic results on co-secure domination in graphs
This page was built for publication: Dominating sets for split and bipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q794174)
