Structure of squares and efficient domination in graph classes
type: Item
instance of: scholarly article
title: Structure of squares and efficient domination in graph classes
zbMATH Open document ID: 1353.05094
author: T. Karthick
published in: Theoretical Computer Science
publication date: 2016-11-04T00:00:00Z
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 6647911
zbMATH Keywords: graph algorithms
zbMATH Keywords: square graph
zbMATH Keywords: domination
zbMATH Keywords: efficient domination
zbMATH Keywords: graph classes
MaRDI profile type: Publication
full work available at URL: j.tcs.2016.09.002
OpenAlex ID: W2519091437
cites work: On easy and hard hereditary classes of graphs with respect to the independent set problem
cites work: Q3815323
cites work: Maximum weight independent sets in hole- and dart-free graphs
cites work: Efficient domination for classes of \(P_6\)-free graphs
cites work: Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs
cites work: Weighted efficient domination in two subclasses of \(P_6\)-free graphs
cites work: Graph Classes: A Survey
cites work: New Polynomial Cases of the Weighted Efficient Domination Problem
cites work: Q4093489
cites work: Corrigendum to our paper ''The ellipsoid method and its consequences in combinatorial optimization''
cites work: Perfect codes in the graphs \(O_k\)
cites work: Q4368728
cites work: Weighted independent sets in a subclass of \(P_6\)-free graphs
cites work: New Polynomial Case for Efficient Domination in P 6-free Graphs
cites work: Independence and Efficient Domination on P6-free Graphs
cites work: Solving the weighted efficient edge domination problem on bipartite permutation graphs
cites work: Weighted efficient domination problem on some perfect graphs
cites work: A polynomial algorithm to find an independent set of maximum weight in a fork-free graph
cites work: Computing roots of graphs is hard
cites work: A New Algorithm for the Maximum Weighted Stable Set Problem in Claw-Free Graphs
cites work: Q4390693
cites work: Distance regular subgraphs of a cube
cites work: Dominating sets in n‐cubes
cites work: Multiplying matrices faster than coppersmith-winograd
cites work: The weighted perfect domination problem
cites work: The weighted perfect domination problem and its variants
DOI: 10.1016/J.TCS.2016.09.002
description: scientific article; zbMATH DE number 6647911