Absolute reflexive retracts and absolute bipartite retracts
From MaRDI portal
Publication:686243
DOI10.1016/0166-218X(93)90219-EzbMATH Open0795.05133OpenAlexW1987058044MaRDI QIDQ686243FDOQ686243
Martin Farber, Hans-Jürgen Bandelt, Pavol Hell
Publication date: 30 November 1993
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0166-218x(93)90219-e
Cites Work
- Vertex-to-vertex pursuit in a graph
- Clique graphs and Helly graphs
- Dismantling absolute retracts of reflexive graphs
- Classes of bipartite graphs related to chordal graphs
- Title not available (Why is that?)
- Absolute retracts of bipartite graphs
- Absolute planar retracts and the four colour conjecture
- Absolute Retracts and Varieties of Reflexive Graphs
- Title not available (Why is that?)
- Products of absolute retracts
- A fixed cube theorem for median graphs
- The smallest graph variety containing all paths
- Pseudo-modular graphs
- Graphs with edge-preserving majority functions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (21)
- List-homomorphism problems on graphs and arc consistency
- List homomorphism problems for signed trees
- Absolute retracts and varieties generated by chordal graphs
- Characterizing bipartite graphs which admit a \(k\)-NU polymorphism via absolute retracts
- Biclique-Helly graphs
- Graphs with edge-preserving majority functions
- Colouring, constraint satisfaction, and complexity
- Posets, clique graphs and their homotopy type
- Incidence graphs of biacyclic hypergraphs
- Computational Complexity of Graph Partition under Vertex-Compaction to an Irreflexive Hexagon
- Generating bicliques of a graph in lexicographic order
- On the generation of bicliques of a graph
- A complete and equal computational complexity classification of compaction and retraction to all graphs with at most four vertices and some general results
- Dually chordal graphs
- Computational complexity relationship between compaction, vertex-compaction, and retraction
- On neighborhood-Helly graphs
- Beyond Helly graphs: the diameter problem on absolute retracts
- A surprising permanence of old motivations (a not-so-rigid story)
- List homomorphisms to reflexive graphs
- Computational complexity of compaction to irreflexive cycles
- Injective envelope of graphs and transition systems
Recommendations
This page was built for publication: Absolute reflexive retracts and absolute bipartite retracts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q686243)
