Indominable graphs cannot be characterised by a family of forbidden subgraphs

zbMath0476.05068MaRDI QIDQ1160194

H. B. Walikar, Belmannu Devadas Acharya

Publication date: 1981

Published in: National Academy Science Letters (Search for Journal in Brave)

zbMATH Keywords

independent setdominating setforbidden subgraphindominable graph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)

Related Items (1)

Bibliography on domination in graphs and some basic definitions of domination parameters

This page was built for publication: Indominable graphs cannot be characterised by a family of forbidden subgraphs