Skip to main content

Advertisement

Log in

Polynomial algorithms for kernels in comparability, permutation and P4-free graphs

  • Published:
4OR Aims and scope Submit manuscript

    We’re sorry, something doesn't seem to be working properly.

    Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

Abstract.

In this paper, we give three polynomial algorithms which detect a kernel in comparability graphs relatively to an M-orientation, in permutation graphs and in P4-free graphs with a normal orientation.

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

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Youcef Saoula.

Additional information

MSC classification:

05C69, 05C85

Correspondence to: Saoula Youcef

Rights and permissions

Reprints and permissions

About this article

Cite this article

Abbas, M., Saoula, Y. Polynomial algorithms for kernels in comparability, permutation and P4-free graphs. 4OR 3, 217–225 (2005). https://doi.org/10.1007/s10288-005-0067-9

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10288-005-0067-9

Keywords: