The complexity of the fixed clique property

DOI10.7155/JGAA.V28I1.2957MaRDI QIDQ6616237zbMATH OpenFDO

Authors Bernd Schröder

Publication date 8 October 2024

Published in Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.7155/JGAA.V28I1.2957

zbMATH Keywords

complexityfixed clique propertyfixed simplex property

Mathematics Subject Classification ID

Combinatorial aspects of simplicial complexes (05E45)

Recommendations

• The complexity of the fixed point property
• Fixed points of posets and clique graphs
• Algorithms for the fixed point property
• Decision tree complexity of graph properties with dimension at most 5
• Clique divergent clockwork graphs and partial orders

Cites work

• A combinatorial proof of a fixed point property
• Dismantlable graphs and posets, fixed clique property
• Fixed points in partially ordered sets
• Fixed points of group actions on link collapsible simplicial complexes
• Fixed-edge theorem for graphs with loops
• Ordered sets. An introduction with connections from combinatorics to topology
• Ordonnés escamotables et points fixes. (Dismantlable orders and fixed points)
• Reflexive digraphs with near unanimity polymorphisms
• Retract‐collapsible graphs and invariant subgraph properties
• The complexity of the fixed point property
• The fixed vertex property for graphs
• The use of retraction in the fixed point theory for ordered sets
• Two order invariants related to the fixed point property

This page was built for publication: The complexity of the fixed clique property

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6616237)