Computational complexity aspects of super domination
From MaRDI portal
Publication:6076353
DOI10.1016/j.tcs.2023.114137arXiv2302.08862OpenAlexW4385988477MaRDI QIDQ6076353
Csilla Bujtás, Sandi Klavžar, Nima Ghanbari
Publication date: 21 September 2023
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2302.08862
treecomputational complexitybipartite graphmatchingsuper domination number\(k\)-subdivision of a graphII-matching
Cites Work
- Unnamed Item
- Unnamed Item
- Super dominating sets in graphs
- NP-completeness of some generalizations of the maximum matching problem
- Finding maximum induced matchings in subclasses of claw-free and \(P_5\)-free graphs, and in graphs with matching and induced matching of equal maximum size
- New results on induced matchings
- Super domination in trees
- Linear-time algorithms for maximum-weight induced matchings and minimum chain covers in convex bipartite graphs
- Tree-width dichotomy
- Finding dominating induced matchings in \(P_9\)-free graphs in polynomial time
- Resistance characterizations of equiarboreal graphs
- Exact algorithms for maximum induced matching
- On the super domination number of lexicographic product graphs
- Graph-theoretic parameters concerning domination, independence, and irredundance
- Finding Even Cycles Even Faster
- Coloring 3-power of 3-subdivision of subcubic graph
- On the super domination number of graphs
- Reducibility among Combinatorial Problems
- On the Djokovi\'c-Winkler relation and its closure in subdivisions of fullerenes, triangulations, and chordal graphs
- Efficient Algorithms for Maximum Induced Matching Problem in Permutation and Trapezoid Graphs
- Total dominator chromatic number of k-subdivision of graphs
- Super domination in trees
- Structures of Domination in Graphs
- Topics in Domination in Graphs
- Double domination and super domination in trees
- Induced matchings in strongly biconvex graphs and some algebraic applications
This page was built for publication: Computational complexity aspects of super domination
