A characterization of domination reducible graphs

DOI10.1007/s00373-003-0541-0zbMath1055.05117OpenAlexW2013267996MaRDI QIDQ1889837

Igor Edm. Zverovich

Publication date: 13 December 2004

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-003-0541-0

zbMATH Keywords

forbidden induced subgraphsdomination numberhomogeneous sethereditary class of graphs

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (5)

Independent domination in hereditary classes ⋮ Characterization of graphs dominated by induced paths ⋮ All minimal prime extensions of hereditary classes of graphs ⋮ Substitution-closed pattern classes ⋮ A finiteness theorem for primal extensions

This page was built for publication: A characterization of domination reducible graphs