𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Hereditary Domination in Graphs: Characterization with Forbidden Induced Subgraphs

✍ Scribed by Tuza, Zsolt

Book ID
118197699
Publisher
Society for Industrial and Applied Mathematics
Year
2008
Tongue
English
Weight
128 KB
Volume
22
Category
Article
ISSN
0895-4801

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Dominating subgraphs in graphs with some
Dominating subgraphs in graphs with some forbidden structures
✍ Jiping Liu; Huishan Zhou πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 387 KB

We characterize the triangle-free graphs with neither induced path of six vertices nor induced cycle of six vertices and the triangle-free graphs without induced path of six vertices in terms of dominating subgraphs.

Characterizing path graphs by forbidden
Characterizing path graphs by forbidden induced subgraphs
✍ Benjamin LΓ©vΓͺque; FrΓ©dΓ©ric Maffray; Myriam Preissmann πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 197 KB

## Abstract A path graph is the intersection graph of subpaths of a tree. In 1970, Renz asked for a characterization of path graphs by forbidden induced subgraphs. We answer this question by determining the complete list of graphs that are not path graphs and are minimal with this property. Β© 2009

An induced subgraph characterization of
An induced subgraph characterization of domination perfect graphs
✍ Igor E. Zvervich; Vadim E. Zverovich πŸ“‚ Article πŸ“… 1995 πŸ› John Wiley and Sons 🌐 English βš– 800 KB

## Abstract Let Ξ³(__G__) ΞΉ(__G__) be the domination number and independent domination number of a graph (__G__), respectively. A graph (__G__) is called domination perfect if Ξ³(__H__) = ΞΉ(__H__), for every induced subgraph __H__ of (__G__). There are many results giving a partial characterization o

A semi-induced subgraph characterization
A semi-induced subgraph characterization of upper domination perfect graphs
✍ Zverovich, Igor E.; Zverovich, Vadim E. πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 324 KB πŸ‘ 2 views

Let Ξ²(G) and Ξ“(G) be the independence number and the upper domination number of a graph G, respectively. A graph G is called Ξ“-perfect if Ξ²(H) = Ξ“(H), for every induced subgraph H of G. The class of Ξ“-perfect graphs generalizes such well-known classes of graphs as strongly perfect graphs, absorbantl

Traceability in graphs with forbidden tr
Traceability in graphs with forbidden triples of subgraphs
✍ Ronald J. Gould; John M. Harris πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 724 KB

If 9 is a collection of connected graphs, and if a graph G does not contain any member of 9 as an induced subgraph, then G is said to be F-free. The members of f in this situation are called forbidden subgraphs. In a previous paper (Gould and Harris, 1995) the authors demonstrated two families of tr