Skip to main content
SpringerLink
Log in

Erdös-Hajnal Well-Orderings andn-Degenerate Graphs

  • Published:
Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg Aims and scope Submit manuscript

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

References

  1. P. Erdös andA. Hajnal: On chromatic number of graphs and set-systems. Acta Math. Acad. Sci. Hung.17, 61–99 (1966).

    Article  MATH  Google Scholar 

  2. R. Halin: Unterteilungen vollständiger Graphen in Graphen mit unendlicher chromatischer Zahl. Abh. Math. Sem. Univ. Hamburg31, 156–166 (1967).

    Article  MATH  MathSciNet  Google Scholar 

  3. F. Harary: Graph Theory, Addison-Wesley, Reading, 1969.

    Google Scholar 

  4. H. Kronk andJ. Mitchem: On critical point-arboritic graphs, J. London Math. Soc. (2),9, 459–466 (1975).

    Article  MATH  MathSciNet  Google Scholar 

  5. D. R. Lick: A class of point-partition numbers, Recent Trends in Graph Theory, Lecture Notes in Mathematics, vol. 186, Springer Berlin, 1970, 185–190.

    Article  MathSciNet  Google Scholar 

  6. D. R. Lick andA. T. White:k-degenerate graphs, Canadian J. Math.22, 1082–1096 (1970).

    MATH  MathSciNet  Google Scholar 

  7. D. R. Lick andA. T. White: Point-partition numbers of complementary graphs, Math. Japonicae19, 233–237 (1974).

    MATH  MathSciNet  Google Scholar 

  8. D. R. Lick andA. T. White: The point-partition numbers of closed 2-manifolds, J. London Math. Soc.4, 577–583 (1972).

    Article  MATH  MathSciNet  Google Scholar 

  9. D. R. Lick, F. Hababy andG. Chabtrand: Maximal point-arboritic graphs, Utilitas Mathematica,9, 259–262 (1976).

    MATH  MathSciNet  Google Scholar 

  10. J. Mitchem: Maximalk-degenerate graphs, Utilitas Mathematica,11, 101–106 (1977).

    MATH  MathSciNet  Google Scholar 

  11. J. Mitchem: On graphs with prescribed clique-number and point-arboricity, J. London Math. Soc. (2),4, 333–336 (1971).

    Article  MATH  MathSciNet  Google Scholar 

  12. J. Mitchem: On the point-arboricity of a graph and its complement, Canadian J. Math.23, 287–292 (1971).

    MATH  MathSciNet  Google Scholar 

  13. J. Mitchem: Uniquelyk-arborable graphs, Israel J. Math.10, 17–25 (1971).

    Article  MATH  MathSciNet  Google Scholar 

  14. J. M. S. Simões-Pereira: A note on graphs with prescribed clique and pointpartition numbers, J. Comb. Theory14, 256–258 (1973).

    MATH  Google Scholar 

  15. J. M. S. Simões-Pereira: On graphs uniquely partitionable inton-degenerate subgraphs, Coll. Math. Soc. János Bolyai,10. Infinite and Finite Sets, Keszthely 1973, North-Holland Amsterdam (1975), 1351–1364.

    Google Scholar 

  16. J. M. S. Simões-Pereira: Joins ofn-degenerate graphs and uniquely (m, n)- partitionable graphs, J. Combinatorial Theory Ser.B 21 21–29 (1976).

    Article  Google Scholar 

  17. J. M. S. Simões-Pereira: A survey ofk-degenerate graphs, Graph Theory Newsletter 5 (6), July, 1976.

Download references

Author information

Authors and Affiliations

  1. Department of Mathematical Sciences Hunter College—CUNY, 695 Park Avenue, 10021, New York, NY

    J. M. S. Simões-Pereira

Authors
  1. J. M. S. Simões-Pereira
    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

Simões-Pereira, J.M.S. Erdös-Hajnal Well-Orderings andn-Degenerate Graphs. Abh.Math.Semin.Univ.Hambg. 50, 101–107 (1980). https://doi.org/10.1007/BF02941418

Download citation

  • Received:

  • Issue Date:

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

Search

Navigation