The fixed vertex property for graphs
From MaRDI portal
Recommendations
Cites work
- A fixed point theorem for finite partially orderes sets
- A Theorem on Partially Ordered Sets, With Applications to Fixed Point Theorems
- Algorithms for the fixed point property
- Examples of powers of ordered sets with the fixed point property
- Fixed point property for 11-element sets
- Fixed points and products
- Fixed points and products: Width 3
- Fixed points of posets and clique graphs
- Handbook of constraint programming.
- Hedetniemi's conjecture and the retracts of a product of graphs
- scientific article; zbMATH DE number 4106917 (Why is no real title available?)
- scientific article; zbMATH DE number 1862431 (Why is no real title available?)
- scientific article; zbMATH DE number 2117181 (Why is no real title available?)
- On an example of Rutkowski and Schröder
- Reflexive digraphs with near unanimity polymorphisms
- The complexity of the fixed point property
- The fixed point property for ordered sets
- The fixed point property for small sets
Cited in
(4)
This page was built for publication: The fixed vertex property for graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q890011)