The complexity of the fixed clique property

DOI10.7155/JGAA.V28I1.2957zbMATH Open1548.05347MaRDI QIDQ6616237

Bernd Schröder

Publication date: 8 October 2024

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

zbMATH Keywords

complexityfixed clique propertyfixed simplex property

Mathematics Subject Classification ID

Combinatorial aspects of simplicial complexes (05E45)

Cites Work

• Title not available (Why is that?)
• A combinatorial proof of a fixed point property
• Reflexive digraphs with near unanimity polymorphisms
• The fixed vertex property for graphs
• Ordonnés escamotables et points fixes. (Dismantlable orders and fixed points)
• Two order invariants related to the fixed point property
• Dismantlable graphs and posets, fixed clique property
• The complexity of the fixed point property
• Fixed points of group actions on link collapsible simplicial complexes
• Ordered Sets
• Fixed-edge theorem for graphs with loops
• Retract‐collapsible graphs and invariant subgraph properties
• Fixed points in partially ordered sets

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)