scientific article; zbMATH DE number 3460321

MaRDI QIDQ4046079zbMATH OpenFDO

Authors

Publication date 1974

Mathematics Subject Classification ID

Graph theory (05C99) Algorithms in computer science (68W99) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Cited in

(13)

• On the recognition complexity of some graph properties
• Elusive properties of infinite graphs
• A topological approach to evasiveness
• Searching for an edge in a graph
• On lattices with Möbius function \(\pm 1,0\)
• On computing majority by comparisons
• The smallest nonevasive graph property
• Using Brouwer’s Fixed Point Theorem
• Some results on the complexity of families of sets
• On recognizing graph properties from adjacency matrices
• An asymptotic bound for the complexity of monotone graph properties
• Simplicial complexes and the evasiveness conjecture
• Further results on the Aanderaa-Rosenberg conjecture

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 Q4046079)