Absolute retracts of bipartite graphs
From MaRDI portal
Publication:1820174
DOI10.1016/0166-218X(87)90058-8zbMath0614.05046OpenAlexW2049227779WikidataQ56335668 ScholiaQ56335668MaRDI QIDQ1820174
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
Related Items (29)
Pseudo-modular graphs ⋮ Absolute retracts of split graphs ⋮ On the natural imprint function of a graph ⋮ One more well-solved case of the multifacility location problem ⋮ Hereditary modular graphs ⋮ On cube-free median graphs ⋮ Computational complexity of compaction to irreflexive cycles ⋮ Dismantling absolute retracts of reflexive graphs ⋮ Incidence graphs of biacyclic hypergraphs ⋮ List homomorphisms to reflexive graphs ⋮ Graphs with a regular endomorphism monoid ⋮ Beyond Helly graphs: the diameter problem on absolute retracts ⋮ Graphs with \(G^p\)-connected medians ⋮ Dually chordal graphs ⋮ Colouring, constraint satisfaction, and complexity ⋮ Efficient characterizations of \(n\)-chromatic absolute retracts ⋮ On retracts, absolute retracts, and foldings in cographs ⋮ Graphs with edge-preserving majority functions ⋮ Absolute reflexive retracts and absolute bipartite retracts ⋮ Products of absolute retracts ⋮ Absolute retracts and varieties generated by chordal graphs ⋮ On the extension of vertex maps to graph homomorphisms ⋮ Computational complexity relationship between compaction, vertex-compaction, and retraction ⋮ Characterizing bipartite graphs which admit a \(k\)-NU polymorphism via absolute retracts ⋮ 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 ⋮ Wiener index and Steiner 3-Wiener index of graphs ⋮ Complexity of homomorphisms to direct products of graphs ⋮ Algebra complexity problems involving graph homomorphism, semigroups and the constraint satisfaction problem
Cites Work
- Medians in median graphs
- A characterization of absolute retracts of n-chromatic graphs
- Betweenness isomorphisms of modular lattices
- Path length in the covering graph of a lattice
- The smallest graph variety containing all paths
- Retracts of hypercubes
- Graphs Orientable as Distributive Lattices
- Fixed-edge theorem for graphs with loops
- Perfect Elimination and Chordal Bipartite Graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Absolute retracts of bipartite graphs
