scientific article; zbMATH DE number 3617539

MaRDI QIDQ4181269zbMATH OpenFDO

Authors Eric C. Milner, D. J. A. Welsh

Publication date 1976

zbMATH Keywords

adjacency matricescomputational complexity of graph theoretical propertiesprobing

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Analysis of algorithms and problem complexity (68Q25)

Cited in

(10)

• Complete subgraphs are elusive
• Further results on the Aanderaa-Rosenberg conjecture
• On recognizing graph properties from adjacency matrices
• Packings of graphs and applications to computational complexity
• Packing of graphs - a survey
• Using Brouwer’s Fixed Point Theorem
• The smallest nonevasive graph property
• On the elusiveness of Hamiltonian property
• Evasiveness through binary decision diagrams
• Dominic Welsh: his work and influence

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4181269)