Recommendations
Cites work
- scientific article; zbMATH DE number 3854827 (Why is no real title available?)
- scientific article; zbMATH DE number 3697163 (Why is no real title available?)
- scientific article; zbMATH DE number 3463659 (Why is no real title available?)
- scientific article; zbMATH DE number 3482391 (Why is no real title available?)
- A characterization of absolute retracts of n-chromatic graphs
- Betweenness isomorphisms of modular lattices
- Fixed-edge theorem for graphs with loops
- Graphs Orientable as Distributive Lattices
- Medians in median graphs
- Path length in the covering graph of a lattice
- Perfect Elimination and Chordal Bipartite Graphs
- Retracts of hypercubes
- The smallest graph variety containing all paths
Cited in
(32)- Computational complexity of compaction to irreflexive cycles
- Products of absolute retracts
- A complete and equal computational complexity classification of compaction and retraction to all graphs with at most four vertices and some general results
- One more well-solved case of the multifacility location problem
- On cube-free median graphs
- Computational complexity relationship between compaction, vertex-compaction, and retraction
- Incidence graphs of biacyclic hypergraphs
- Pseudo-modular graphs
- A characterization of absolute retracts of n-chromatic graphs
- Graphs with a regular endomorphism monoid
- On retracts, absolute retracts, and foldings in cographs
- Colouring, constraint satisfaction, and complexity
- Dismantling absolute retracts of reflexive graphs
- Absolute reflexive retracts and absolute bipartite retracts
- Absolute retracts and varieties generated by chordal graphs
- Hereditary modular graphs
- Dually chordal graphs
- Complexity of homomorphisms to direct products of graphs
- On the extension of vertex maps to graph homomorphisms
- Characterizing bipartite graphs which admit a \(k\)-NU polymorphism via absolute retracts
- Absolute Retracts and Varieties of Reflexive Graphs
- List homomorphisms to reflexive graphs
- Beyond Helly graphs: the diameter problem on absolute retracts
- Computational Complexity of Graph Partition under Vertex-Compaction to an Irreflexive Hexagon
- Algebra complexity problems involving graph homomorphism, semigroups and the constraint satisfaction problem
- ABC(T)-graphs: an axiomatic characterization of the median procedure in graphs with connected and \(G^2\)-connected medians
- Graphs with \(G^p\)-connected medians
- Absolute retracts of split graphs
- Efficient characterizations of \(n\)-chromatic absolute retracts
- On the natural imprint function of a graph
- Wiener index and Steiner 3-Wiener index of graphs
- Graphs with edge-preserving majority functions
This page was built for publication: Absolute retracts of bipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1820174)
