Decision tree complexity of graph properties with dimension at most 5

DOI10.1007/BF02950404zbMath0961.68108OpenAlexW2061130392MaRDI QIDQ1587333

Guo-Hui Lin, Sui-Xiang Gao

Publication date: 28 May 2001

Published in: Journal of Computer Science and Technology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02950404

zbMATH Keywords

monotone graph property

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (1)

On the elusiveness of Hamiltonian property

Cites Work

• A topological approach to evasiveness
• Complete subgraphs are elusive
• Some Results on Elusive Graph Properties

This page was built for publication: Decision tree complexity of graph properties with dimension at most 5