The generic circular triangle-free graph
From MaRDI portal
Cites work
- A dichotomy theorem for nonuniform CSPs
- A proof of CSP dichotomy conjecture
- A proof of the CSP dichotomy conjecture
- Acyclic graph coloring and the complexity of the star chromatic number
- Algebraic Approach to Promise Constraint Satisfaction
- An algorithmic blend of LPs and ring equations for promise CSPs
- Characterizations and recognition of circular-arc graphs and subclasses: a survey
- Circular chromatic number: A survey
- Complexity of infinite-domain constraint satisfaction
- Describing hereditary properties by forbidden circular orderings
- Graph theory
- Graphs whose every independent set has a common neighbour
- scientific article; zbMATH DE number 44603 (Why is no real title available?)
- scientific article; zbMATH DE number 2117181 (Why is no real title available?)
- Maximal digraphs with respect to primitive positive constructability
- Normal Helly circular-arc graphs and its subclasses
- On the complexity of H-coloring
- On the complexity of the circular chromatic number
- On the Structure of Dense Triangle-Free Graphs
- Point determination in graphs
- PROJECTIVE CLONE HOMOMORPHISMS
- Promise constraint satisfaction: structure theory and a symmetric Boolean dichotomy
- Smooth digraphs modulo primitive positive constructability and cyclic loop conditions
- Star chromatic number
- The equivalence of two dichotomy conjectures for infinite domain constraint satisfaction problems
- The wonderland of reflections
- Topology and Adjunction in Promise Constraint Satisfaction
This page was built for publication: The generic circular triangle-free graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6962798)
