Skip to main content
SpringerLink
Log in

Representations of graphs by means of products and their complexity

  • Invited Lectures
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1981 (MFCS 1981)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 118))

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ben Dushnik and E.W. Miller: Partially ordered sets, Amer.J.Math. 16 (1941), 600–610.

    Google Scholar 

  2. Garey, M.R. and Johnson, D.S.: Computers and Intractability, W.H.Freeman, San Francisco, 1979.

    Google Scholar 

  3. Greenwell, D. and Lovász, L. Applications of product coloring, Acta Math. Acad. Sci.Hungar. 25 (1974),335–340.

    Google Scholar 

  4. Kučera, L., Nešetřil, J. and A Pultr A.: The complexity of dimension three and other covering characteristics of a graph, Theor. Comp. Sci. (1980)

    Google Scholar 

  5. Lovász, L.: On the cancelation law among finite relational structures, Periodica Math. Hungar. 1, (1971) 145–156

    Google Scholar 

  6. Lovász, L., Nešetřil, J. and Pultr, A.: On a product dimension of a graph, J. Comb. Th. B, 29,1 (1980), 47–67

    Google Scholar 

  7. Nešetřil, J. and Rödl, V.: Products of graphs and their applicatie ons, to appear in Proceedings of the Kuratowski conference Łagovo, Poland (1981).

    Google Scholar 

  8. Nešetřil, J. and Rödl, V.: A simple proof of the Galvin-Ramsey prope property of the class of finite graphs and a dimension of a graph, Discrete Math. 23 (1978), 49–55.

    Google Scholar 

  9. Nešetřil, J. and Pultr, A.: On classes of graphs determined by subobjects and factorobjects, Discrete Math. 22 (1978), 287–300

    Google Scholar 

  10. Nešetřil, J. and Pultr, A.: A Dushnik-Miller type dimension of graphs and its complexity. In: Lecture Notes in Comp. Sci., No. 56, Springer Verlag, Berlin/New York, (1977), 482–493

    Google Scholar 

  11. Poljak, S., Pultr, A. and Rödl, V.: On the dimension of bipartite graphs, to appear in J. of Graph Theory

    Google Scholar 

  12. Poljak, S. and Pultr, A.: Dimension by strong products, Comment. Math. Univ. Carolinae (1981)

    Google Scholar 

  13. Pultr, A. and Vinárek, J.: Productive classes and subdirect irreducibility, Discrete Math. 20 (1977),159–176.

    Google Scholar 

  14. Sabidussi, G.: Subdirect representation of graphs, In: Coll. Math. Soc. J. Bolyai 10 (1973), North Holland, Amsterdam 1199–1226

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. KZAA MFF, Charles University, Sokolovská 83, 186 00, Praha 8, Czechoslovakia

    Jaroslav Nešetřil

Authors
  1. Jaroslav Nešetřil
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jozef Gruska Michal Chytil

Rights and permissions

Reprints and permissions

Copyright information

© 1981 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Nešetřil, J. (1981). Representations of graphs by means of products and their complexity. In: Gruska, J., Chytil, M. (eds) Mathematical Foundations of Computer Science 1981. MFCS 1981. Lecture Notes in Computer Science, vol 118. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10856-4_76

Download citation

  • DOI: https://doi.org/10.1007/3-540-10856-4_76

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-10856-6

  • Online ISBN: 978-3-540-38769-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation