Skip to main content
SpringerLink
Log in

The complexity of cubical graphs

Extended abstract

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1984)

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

Included in the following conference series:

  • 138 Accesses

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. D. J. Djocovic, Distance-preserving subgraphs of hypercubes, J. Combinatorial Theory Ser. B 14 (1973), 263–267.

    Google Scholar 

  2. M. R. Garcy & R. L. Graham, On cubical graphs, J. Combinatorial Theory 18 (1973), 263–267.

    Google Scholar 

  3. M. R. Garcy & D. S. Johnson, Computers and Intractability: A guide to the theory of NP-completeness, Freeman, San Francisco, 1979.

    Google Scholar 

  4. I. Havel, Embedding graphs in undirected and directed cubes, Proc. Conf. Lagow (1981), Poland.

    Google Scholar 

  5. I. Havel & P. Liedl, Embedding the dichotomic tree into the cube, Cas Pest. Mat. 97 (1972), 201–205.

    Google Scholar 

  6. I. Havel & P. Liebl, Embedding the polytomic tree into the n-cube, Cas Pest. Mat. 98 (1973), 307–314.

    Google Scholar 

  7. I. Havel & J. Moravel, B-valuation of graphs, Czech. Math. J. 22 (1972), 338–351.

    Google Scholar 

  8. L. Nebesky, On cubes and dichotomic trees, Cas. Pest. Mat. 99 (1974), 164–167.

    Google Scholar 

  9. G. Papageorgiou, PH. D. Thesis, National Technical University of Athens, in preparation.

    Google Scholar 

  10. M.S. Paterson, Private Communication, March 1984.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. National Technical University of Athens, Greece

    Foto Afrati, Christos H. Papadimitriou & George Papageorgiou

  2. Stanford University, USA

    Christos H. Papadimitriou

Authors
  1. Foto Afrati
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Christos H. Papadimitriou
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. George Papageorgiou
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jan Paredaens

Rights and permissions

Reprints and permissions

Copyright information

© 1984 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Afrati, F., Papadimitriou, C.H., Papageorgiou, G. (1984). The complexity of cubical graphs. In: Paredaens, J. (eds) Automata, Languages and Programming. ICALP 1984. Lecture Notes in Computer Science, vol 172. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-13345-3_4

Download citation

  • DOI: https://doi.org/10.1007/3-540-13345-3_4

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-13345-2

  • Online ISBN: 978-3-540-38886-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation