Advertisement

Elusive properties

  • E. Triesch
Conference paper
Part of the Lecture Notes in Mathematics book series (LNM, volume 969)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [BBL]
    Best, M.R., van Emde Boas, P and Lenstra, Jr. H.W.: "A sharpened version of the Aanderaa-Rosenberg conjecture", Math. Centrum, Amsterdam, 1974.zbMATHGoogle Scholar
  2. [B1]
    Bollobás, B.: "Complete Subgraphs are elusive", J.Comb.Th. Ser.B. 21 (1976), 1–7.MathSciNetCrossRefzbMATHGoogle Scholar
  3. [B2]
    Bollobás, B.: "Extremal graph theory". Acad.Press, London, 1978.zbMATHGoogle Scholar
  4. [BE]
    Bollobás, B. and Eldridge, S.E.: "Problem", in: "Proc.Fifth British Combinatorial Conference", (Nash-Williams, C.St.J.A. and Sheehan, J., eds.), Utilitas Math., Winnipeg, 1976, 689–691.Google Scholar
  5. [KK]
    Kleitman, D.J. and Kwiatkowski, D.J.: "Further results on the Aanderaa-Rosenberg conjecture" J. Comb.Th. Ser.B. 28 (1980), 85–95.MathSciNetCrossRefzbMATHGoogle Scholar
  6. [MW1]
    Milner, E.C. and Welsh, D.J.A.: "On the computational complexity of graph theoretical properties", Univ. of Calgary, Res.Paper No.232, June, 1974.Google Scholar
  7. [MW2]
    Milner, E.C. and Welsh, D.J.A.: "On the computational complexity of graph theoretical properties", in: "Proc.Fifth Brithish Combinatorial Conference". (Nash-Williams, C.St.J.A. and Sheehan, J., eds.), Utilitas Math., Winnipeg, 1976, 471–487.Google Scholar
  8. [RV]
    Rivest, R.L. and Vuillemin, J.: "On recognizing graph properties from adjacency matrices", Theor.Comput.Sci. 3 (1976/77), 371–384.MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer-Verlag 1982

Authors and Affiliations

  • E. Triesch
    • 1
  1. 1.Lehrstuhl für Angewandte Mathematik RWTH AachenAachenFederal Republic of Germany

Personalised recommendations