Complete description of forbidden subgraphs in the structural domination problem
type: Item
instance of: scholarly article
title: Complete description of forbidden subgraphs in the structural domination problem
zbMATH Open document ID: 1210.05093
author: Gábor Bacsó
published in: Discrete Mathematics
publication date: 2009-06-19T00:00:00Z
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 05C40
zbMATH DE Number: 5566712
zbMATH Keywords: graph domination
zbMATH Keywords: connected graphs
MaRDI profile type: Publication
full work available at URL: j.disc.2008.05.053
OpenAlex ID: W2046940797
cites work: Dominating Bipartite Subgraphs in Graphs
cites work: Dominating cliques in \(P_ 5\)-free graphs
cites work: A characterization of graphs without long induced paths
cites work: Domination properties and induced subgraphs
cites work: Q4227911
cites work: Q5461526
cites work: Graphs without induced P5and C5
cites work: Characterization of graphs dominated by induced paths
cites work: The maximum number of edges in \(2K_ 2\)-free graphs of bounded degree
cites work: Star-cutsets and perfect graphs
cites work: Dominating cliques in graphs
cites work: Some results on graphs without long induced paths
cites work: On the existence of two non-neighboring subgraphs in a graph
cites work: Maximum induced trees in graphs
cites work: On \(m\)-centers in \(P_ t\)-free graphs
cites work: Q4368728
cites work: Dominating subgraphs in graphs with some forbidden structures
cites work: Dominating sets with small clique covering number
cites work: On a property of the class of n-colorable graphs
cites work: Hereditary Domination in Graphs: Characterization with Forbidden Induced Subgraphs
cites work: Perfect connected-dominant graphs
cites work: The Comparability Graph of a Tree
cites work: Introduction to ``Topics on Domination''
DOI: 10.1016/J.DISC.2008.05.053
description: scientific article; zbMATH DE number 5566712