scientific article; zbMATH DE number 3902707

MaRDI QIDQ3680877zbMATH OpenFDO

Authors Eberhard Triesch

Publication date 1982

zbMATH Keywords

2- connectivityelusivenessgraph propertytransitive permutation groupwinning strategy

Mathematics Subject Classification ID

Set theory (03E99) Graph theory (05C99) 2-person games (91A05)

Recommendations

• Some Results on Elusive Graph Properties
• A generalized model for understanding evasiveness
• Decision tree complexity of graph properties with dimension at most 5
• scientific article; zbMATH DE number 3878983
• Perfectness is an Elusive Graph Property

Cited in

(9)

• Decision tree complexity of graph properties with dimension at most 5
• On the recognition complexity of some graph properties
• scientific article; zbMATH DE number 3878983 (Why is no real title available?)
• Some Results on Elusive Graph Properties
• Perfectness is an Elusive Graph Property
• The smallest nonevasive graph property
• scientific article; zbMATH DE number 2094525 (Why is no real title available?)
• On the elusiveness of Hamiltonian property
• Elusive properties of infinite graphs

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