Characterization of graphs dominated by induced paths
type: Item
instance of: scholarly article
title: Characterization of graphs dominated by induced paths
zbMATH Open document ID: 1114.05069
author: Margit Voigt
author: Gábor Bacsó
author: Zsolt Tuza
published in: Discrete Mathematics
publication date: 2007-03-02T00:00:00Z
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 5130439
zbMATH Keywords: forbidden induced subgraph
MaRDI profile type: Publication
full work available at URL: j.disc.2005.11.035
OpenAlex ID: W2022959563
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: The maximum number of edges in \(2K_ 2\)-free graphs of bounded degree
cites work: Dominating cliques in graphs
cites work: On the existence of two non-neighboring subgraphs in a graph
cites work: Hereditarily dominated graphs
cites work: Dominating sets with small clique covering number
cites work: A characterization of domination reducible graphs
DOI: 10.1016/J.DISC.2005.11.035
description: scientific article; zbMATH DE number 5130439