Absolute retracts of bipartite graphs
From MaRDI portal
DOI10.1016/0166-218X(87)90058-8zbMATH Open0614.05046OpenAlexW2049227779WikidataQ56335668 ScholiaQ56335668MaRDI QIDQ1820174FDOQ1820174
Authors: Yanyan Li 
Publication date: 1987
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0166-218x(87)90058-8
Recommendations
Cites Work
- Retracts of hypercubes
- Title not available (Why is that?)
- Graphs Orientable as Distributive Lattices
- Perfect Elimination and Chordal Bipartite Graphs
- Path length in the covering graph of a lattice
- Fixed-edge theorem for graphs with loops
- Medians in median graphs
- Title not available (Why is that?)
- The smallest graph variety containing all paths
- A characterization of absolute retracts of n-chromatic graphs
- Title not available (Why is that?)
- Betweenness isomorphisms of modular lattices
- Title not available (Why is that?)
Cited In (32)
- On the natural imprint function of a graph
- On retracts, absolute retracts, and foldings in cographs
- Absolute Retracts and Varieties of Reflexive Graphs
- Wiener index and Steiner 3-Wiener index of graphs
- Complexity of homomorphisms to direct products of graphs
- Absolute retracts and varieties generated by chordal graphs
- Characterizing bipartite graphs which admit a \(k\)-NU polymorphism via absolute retracts
- Pseudo-modular graphs
- Graphs with edge-preserving majority functions
- Colouring, constraint satisfaction, and complexity
- Incidence graphs of biacyclic hypergraphs
- Computational Complexity of Graph Partition under Vertex-Compaction to an Irreflexive Hexagon
- 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
- A characterization of absolute retracts of n-chromatic graphs
- Dually chordal graphs
- Products of absolute retracts
- Computational complexity relationship between compaction, vertex-compaction, and retraction
- ABC(T)-graphs: an axiomatic characterization of the median procedure in graphs with connected and \(G^2\)-connected medians
- On the extension of vertex maps to graph homomorphisms
- Beyond Helly graphs: the diameter problem on absolute retracts
- Algebra complexity problems involving graph homomorphism, semigroups and the constraint satisfaction problem
- Absolute reflexive retracts and absolute bipartite retracts
- Hereditary modular graphs
- Graphs with a regular endomorphism monoid
- Dismantling absolute retracts of reflexive graphs
- Efficient characterizations of \(n\)-chromatic absolute retracts
- List homomorphisms to reflexive graphs
- On cube-free median graphs
- Graphs with \(G^p\)-connected medians
- Computational complexity of compaction to irreflexive cycles
- Absolute retracts of split graphs
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)
