Skip to main content
SpringerLink
Log in

Reducing prime graphs and recognizing circle graphs

  • Published:
Combinatorica Aims and scope Submit manuscript

Abstract

We prove a reduction theorem for prime (simple) graphs in Cunningham’s sense. Roughly speaking this theorem says that every prime (simple) graph of ordern>5 “contains” a smaller prime graph of ordern−1. As an application we give a polynomial algorithm for recognizing circle graphs.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. A. Bondy andU. S. R. Murty,Graph Theory with Applications, Macmillan, London, 1976.

    Google Scholar 

  2. A. Bouchet, Caracterisation des symboles croises de genre nul,C. R. Acad. Sci. Paris,274 (1972), 724–727.

    MATH  MathSciNet  Google Scholar 

  3. A. Bouchet, Isotropic Systems,to appear in European J. Combinatorics.

  4. A. Bouchet, Graphic Presentations of Isotropic Systems, submitted.

  5. W. H. Cunningham, Decomposition of Directed Graphs,Siam. J. Alg. Disc. Math.,3 (1982), 214–228.

    Article  MATH  MathSciNet  Google Scholar 

  6. S. Even andA. Itai, Queues, Stacks and Graphs, in:Theory of Machines and Computations, Academic Press, New York, (1971), 71–86.

    Google Scholar 

  7. J. C. Fournier, Une caracterisation des graphes de cordes,C. R. Acad. Sci. Paris,286A (1978), 811–813.

    MathSciNet  Google Scholar 

  8. H. de Frayesseix, A Characterization of Circle Graphs,European J. of Combinatorics,5 (1984), 223–238.

    Google Scholar 

  9. M. C. Golumbic,Algorithmic Graph Theory and perfect graphs, Academic Press, New York, 1980.

    MATH  Google Scholar 

  10. T. Inukai andL. Weinberg, Graph-realizability of Matroids,Annals of the New York Academy of Sciences,319 (1979), 289–305.

    Article  MathSciNet  Google Scholar 

  11. W. T. Tutte, Connectivity in Matroids,Canad. J. Math.,18 (1966), 1301–1324.

    MATH  MathSciNet  Google Scholar 

  12. W. T. Tutte, Lectures on Matroids,J. Res. Nat. Bur. Standards,69 B (1965), 1–47.

    MathSciNet  Google Scholar 

  13. A. Bouchet, Un algorithme polynomial pour reconnaitre les graphes d’alternance,C. R. Acad. Sc. Paris,300 I (1985), 569–572.

    MathSciNet  Google Scholar 

  14. C. P. Gabor, W. Hsu andK. J. Supowit, Recognizing Circle Graphs in Polynomial Time,Proc. 26 IEEE Ann. Symp. 1985.

  15. W. Naji, Reconnaissance des graphes de cordes,Discrete Math.,54 (1985), 329–337.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Université du Maine, 72017, Le Mans Cedex, France

    André Bouchet

Authors
  1. André Bouchet
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bouchet, A. Reducing prime graphs and recognizing circle graphs. Combinatorica 7, 243–254 (1987). https://doi.org/10.1007/BF02579301

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02579301

Keywords

Search

Navigation