Skip to main content
SpringerLink
Log in

Perfectly orderable graphs and almost all perfect graphs are kernelM-solvable

  • Original Papers
  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

A graph is perfectly orderable if and only if it admits an acyclic orientation which does not contain an induced subgraph with verticesa, b, c, d and arcsab, bc, dc. Further a graph is called kernelM-solvable if for every direction of the edges (here pairs of symmetric, i.e. reversible, arcs are allowed) such that every directed triangle possesses at least two pairs of symmetric arcs, there exists a kernel, i.e. an independent setK of vertices such that every other vertex sends some arc towardsK. We prove that perfectly orderable graphs are kernelM-solvable. Using a deep result of Prömel and Steger we derive that almost all perfect graphs are kernelM-solvable.

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. Berge, C.: Graphs. Amsterdam, New York: North-Holland 1985

    Google Scholar 

  2. Berge, C., Duchet, P.: Perfect graphs and kernels. Bulletin of the Institute of Mathematics Academia Sinica16, 263–274 (1988)

    MathSciNet  Google Scholar 

  3. Blidia, M.: Contribution à l’étude des noyaux dans les graphes. Thesis, Université Paris 6, 1984

  4. Blidia, M., Duchet, P., Maffray, F.: Meyniel graphs are kernel-M-solvable. Res. Rep. Univ. Paris 6, 1988

  5. Blidia, M., Duchet, P., Maffray, F.: On kernels of perfect graphs. RUT COR Res. Rep., Rutgers University, 1988

  6. Champetier, C.: Sur l’existence d’un noyau dans les graphes de comparabilité. J. Comb. Theory (B)47, 111–113 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  7. Chvátal, V.: Peffectly ordered graphs. In: Topics on perfect graphs, C. Berge and V. Chvátal, eds., pp 63–65. Amsterdam: North-Holland 1984

    Google Scholar 

  8. Duchet, P.: Parity graphs are kernelM-solvable. J. Comb. Theory (B)43, 121–126 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  9. Maffray, F.: Sur l’existence des noyaux dans les graphes parfait. Thesis, Université Paris 6, 1984

  10. Prömel, H.J., Steger, A.: Almost all Berge graphs are perfect, to appear

  11. Sands, B., Sauer, N., Woodrow, R.: On monochromatic paths in edge coloured digraphs. J. Comb. Theory (B)33, 271–275 (1982)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IMAG, LSD, Université Joseph Fourier, Grenoble, France

    Mostafa Blidia

  2. Fachbereich Mathematik, Universität Rostock, O-2500, Rostock, Germany

    Konrad Engel

Authors
  1. Mostafa Blidia
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Konrad Engel
    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

Blidia, M., Engel, K. Perfectly orderable graphs and almost all perfect graphs are kernelM-solvable. Graphs and Combinatorics 8, 103–108 (1992). https://doi.org/10.1007/BF02350628

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Search

Navigation