On a certain complexity estimate in graph theory
- 19 Downloads
KeywordsGraph 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.
Unable to display preview. Download preview PDF.
- 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.Handbook on Mathematical Logic. Vol. 1: Model Theory [Russian translation], Nauka, Moscow (1982).Google Scholar
- 3.F. Harary, Graph Theory [Russian translation], Mir, Moscow (1973).Google Scholar
- 4.H. Herre, A. H. Mekler, and K. W. Smith, “Superstable graphs,” Fund. Math.,118, No. 2, 75–79 (1983).Google Scholar
© Plenum Publishing Corporation 1996