Skip to main content
Log in

Families of Graphs Closed Under Taking Powers

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract.

 This paper gives simple proofs for “G k∈? implies G k +1∈?” when ? is the family of all interval graphs, all proper interval graphs, all cocomparability graphs, or all m-trapezoid graphs.

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

Additional information

Received: November 21, 1997 Final version received: October 5, 1998

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chen, M., Chang, G. Families of Graphs Closed Under Taking Powers. Graphs Comb 17, 207–212 (2001). https://doi.org/10.1007/PL00007241

Download citation

  • Issue Date:

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

Keywords