The struction of a graph: Application toCN-free graphs


We consider the class of graphs characterized by the forbidden subgraphsC andN:C is the claw (unique graph with degree sequence (3, 1, 1, 1)) andN the net (unique graph with degree sequence (3, 3, 3, 1, 1, 1)). For this class of graphs (calledCN-free) an algorithm is described for determining the stability numberα(G). It is based on a construction associating with anyCN-free graphG anotherCN-free graphG′ such thatα(G′)=α(G)−1. Such a construction reducing the stability number is called a struction.

This is a preview of subscription content, access via your institution.


  1. [1]

    D. Duffins, R. J. Gould andM. S. Jacobson, Forbidden subgraphs and the hamiltonian theme in:The theory and applications of graphs, (G. Chartrand, Y. Alavi, D. L. Goldsmith, L. Lesniak-Foster, D. R. Lick, eds.) J. Wiley (New York) (1981), 297–316.

    Google Scholar 

  2. [2]

    Ch. Ebenegger, P. L. Hammer andD. de Werra, Pseudo-Boolean functions and stability of graphs,Annals of Discrete Math. 19 (1984), 83–98.

    Google Scholar 

  3. [3]

    M. Golumbic,Algorithmic Graph Theory and Perfect Graphs, Academic Press, (1980).

  4. [4]

    P. L. Hammer, N. V. R. Mahade andD. de Werra, Stability inCAN-free graphs,J. of Combinatorial Theory B 38 (1985), 23–30.

    MATH  Article  Google Scholar 

  5. [5]

    G. Minty, On maximal independent sets of vertices in claw-free graphsJ. of Combinatorial Theory B 28 (1980), 284–304.

    MATH  Article  MathSciNet  Google Scholar 

  6. [6]

    N. Sbihi, Algorithme de recherche d’un stable de cardinalité maximum dans un graphe sans étoile,Discrete Mathematics 29 (1980), 53–76.

    MATH  Article  MathSciNet  Google Scholar 

Download references

Author information



Additional information

This work was completed while this author was visiting the Dept. of Combinatories and Optimization at the University of Waterloo, Ontario.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Hammer, P.L., Mahadev, N.V.R. & de Werra, D. The struction of a graph: Application toCN-free graphs. Combinatorica 5, 141–147 (1985).

Download citation

AMS subject classification (1980)

  • 05 C 99
  • 68 E 10