Some Results on Elusive Graph Properties

DOI10.1137/S009753979119415XzbMath0799.05061OpenAlexW2023396579MaRDI QIDQ4291554

Eberhard Triesch

Publication date: 14 November 1994

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s009753979119415x

zbMATH Keywords

simplicial complexeselusivenessgraph propertymatching numberhomology groupstwo-players gamedecreasing graph propertieselusive graph properties

Mathematics Subject Classification ID

2-person games (91A05) Graph theory (including graph drawing) in computer science (68R10) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph theory (05C99) Homology and cohomology theories in algebraic topology (55N99)

Related Items (4)

On the recognition complexity of some graph properties ⋮ An asymptotic bound for the complexity of monotone graph properties ⋮ On the elusiveness of Hamiltonian property ⋮ Decision tree complexity of graph properties with dimension at most 5

This page was built for publication: Some Results on Elusive Graph Properties