Absolute retracts and varieties generated by chordal graphs
From MaRDI portal
Publication:968425
DOI10.1016/j.disc.2009.08.013zbMath1219.05156OpenAlexW2028544177MaRDI QIDQ968425
Publication date: 5 May 2010
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2009.08.013
Related Items (2)
Beyond Helly graphs: the diameter problem on absolute retracts ⋮ Algebra and the Complexity of Digraph CSPs: a Survey
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Absolute reflexive retracts and absolute bipartite retracts
- The strong selection property and ordered sets of finite length
- Clique graphs and Helly graphs
- The theory of convex geometries
- Holes in ordered sets
- On local convexity in graphs
- Bridged graphs and geodesic convexity
- Dismantling absolute retracts of reflexive graphs
- A structure theory for ordered sets
- Graphs with edge-preserving majority functions
- Absolute retracts of bipartite graphs
- The smallest graph variety containing all paths
- Monotone Jónsson operations and near unanimity functions
- Incidence matrices and interval graphs
- Building blocks for the variety of absolute retracts
- A polynomial-time algorithm for near-unanimity graphs
- Absolute Retracts and Varieties of Reflexive Graphs
- Near-Unanimity Functions and Varieties of Reflexive Graphs
- Convexity in Graphs and Hypergraphs
- A Classification of Reflexive Graphs: The use of “Holes”
- Fixed-edge theorem for graphs with loops
- Two-Processor Scheduling with Start-Times and Deadlines
- The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
- Graph Classes: A Survey
- A Characterisation of First-Order Constraint Satisfaction Problems
- Products of absolute retracts
This page was built for publication: Absolute retracts and varieties generated by chordal graphs
