scientific article; zbMATH DE number 3460321
From MaRDI portal
Publication:4046079
zbMATH Open0294.05125MaRDI QIDQ4046079FDOQ4046079
Authors:
Publication date: 1974
Title of this publication is not available (Why is that?)
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
- Searching for an edge in a graph
- A topological approach to evasiveness
- On lattices with Möbius function \(\pm 1,0\)
- On computing majority by comparisons
- Using Brouwer’s Fixed Point Theorem
- The smallest nonevasive graph property
- 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)
