Extension of Hereditary Classes with Substitutions

@article{Zverovich2003ExtensionOH,
  title={Extension of Hereditary Classes with Substitutions},
  author={Igor E. Zverovich},
  journal={Discrete Applied Mathematics},
  year={2003},
  volume={128},
  pages={487-509}
}
Let G and H be graphs. A substitution of H in G instead of a vertex v∈V (G) is the graph G(v → H), which consists of disjoint union of H and G − v with the additional edge-set {xy: x∈V (H); y∈NG(v)}. For a hereditary class of graphs P, the substitutional closure of P is de4ned as the class P∗ consisting of all graphs which can be obtained from graphs in P by repeated substitutions. Let P be an arbitrary hereditary class for which a characterization in terms of forbidden induced subgraphs is… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 16 references

A 4niteness theorem for primal extensions, RUTCOR Research Report RRR 21-2001

  • I. E. Zverovich
  • Rutgers University,
  • 2001
3 Excerpts

Extension of claw-free graphs and (K1 ∪ P4)-free graphs with substitutions

  • A. BrandstS adt, C. HoT ang, I. Zverovich
  • RUTCOR Research Report RRR 28-2001,
  • 2001
1 Excerpt

The reducing copath method for speci4c homogeneous sets, RUTCOR Research Report RRR 18-2001

  • I. E. Zverovich
  • Rutgers University,
  • 2001
3 Excerpts

Hammer , Split graphs , in : Proceedings of the Eighth Southeastern Conference on Combinatorics , Graph Theory and Computing

  • P. L. S. FSoldes
  • Congr . Numer .
  • 1993

Graphs with few cliques

  • E. Prisner
  • in: Graph Theory, Combinatorics, and Algorithms,
  • 1992
1 Excerpt

On the number of maximal stable sets in graphs from hereditary classes, in: Combinatorial-Algebraic Methods in Discrete Optimization, Gor’kij

  • V. E. Alekseev
  • 1991
1 Excerpt

Similar Papers

Loading similar papers…