On the recognition complexity of some graph properties
From MaRDI portal
Publication:1924495
DOI10.1007/BF01844851zbMath0868.68088OpenAlexW2079486985WikidataQ56701667 ScholiaQ56701667MaRDI QIDQ1924495
Publication date: 3 August 1997
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01844851
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (2)
An asymptotic bound for the complexity of monotone graph properties ⋮ On the elusiveness of Hamiltonian property
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A lower bound for the recognition of digraph properties
- A topological approach to evasiveness
- Some results on the complexity of families of sets
- Complete subgraphs are elusive
- Fixed-point sets of group actions on finite acyclic complexes
- Further results on the Aanderaa-Rosenberg conjecture
- On recognizing graph properties from adjacency matrices
- Monotone Bipartite Graph Properties are Evasive
- Some Results on Elusive Graph Properties
- Fixed-Point Theorems for Periodic Transformations
- La structure des $p$-groupes de Sylow des groupes symétriques finis
This page was built for publication: On the recognition complexity of some graph properties
