Siberian Mathematical Journal

, Volume 37, Issue 3, pp 614–617 | Cite as

On a certain complexity estimate in graph theory

  • S. V. Sudoplatov
Article
  • 19 Downloads

Keywords

Graph Theory Complexity Estimate 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    S. V. Sudoplatov, “On basedness in planar-predicate theories and theories without, semicontours,” submitted to VINITI on January 15, 1991, No. 245-V91.Google Scholar
  2. 2.
    Handbook on Mathematical Logic. Vol. 1: Model Theory [Russian translation], Nauka, Moscow (1982).Google Scholar
  3. 3.
    F. Harary, Graph Theory [Russian translation], Mir, Moscow (1973).Google Scholar
  4. 4.
    H. Herre, A. H. Mekler, and K. W. Smith, “Superstable graphs,” Fund. Math.,118, No. 2, 75–79 (1983).Google Scholar

Copyright information

© Plenum Publishing Corporation 1996

Authors and Affiliations

  • S. V. Sudoplatov
    • 1
  1. 1.Novosibirsk

Personalised recommendations