Some Results on Elusive Graph Properties
From MaRDI portal
decreasing graph propertieselusive graph propertieselusivenessgraph propertyhomology groupsmatching numbersimplicial complexestwo-players game
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) Graph theory (including graph drawing) in computer science (68R10) 2-person games (91A05)
Recommendations
- scientific article; zbMATH DE number 3902707
- Decision tree complexity of graph properties with dimension at most 5
- scientific article; zbMATH DE number 3878983
- A topological approach to evasiveness
- On the elusiveness of Hamiltonian property
- On the recognition complexity of some graph properties
- Perfectness is an Elusive Graph Property
- Some results related to the evasiveness conjecture.
- The smallest nonevasive graph property
- scientific article; zbMATH DE number 3900800
Cited in
(10)- 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?)
- scientific article; zbMATH DE number 3902707 (Why is no real title available?)
- Perfectness is an Elusive Graph Property
- scientific article; zbMATH DE number 6119112 (Why is no real title available?)
- The Elser nuclei sum revisited
- On the elusiveness of Hamiltonian property
- Elusive properties of infinite graphs
- An asymptotic bound for the complexity of monotone graph properties
This page was built for publication: Some Results on Elusive Graph Properties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4291554)
