Pages that link to "Item:Q1820174"
From MaRDI portal
The following pages link to Absolute retracts of bipartite graphs (Q1820174):
Displaying 29 items.
- Colouring, constraint satisfaction, and complexity (Q458466) (← links)
- Computational complexity of compaction to irreflexive cycles (Q596309) (← links)
- Absolute reflexive retracts and absolute bipartite retracts (Q686243) (← links)
- On cube-free median graphs (Q864119) (← links)
- Absolute retracts and varieties generated by chordal graphs (Q968425) (← links)
- Pseudo-modular graphs (Q1084416) (← links)
- Hereditary modular graphs (Q1112068) (← links)
- Dismantling absolute retracts of reflexive graphs (Q1121291) (← links)
- List homomorphisms to reflexive graphs (Q1127870) (← links)
- Efficient characterizations of \(n\)-chromatic absolute retracts (Q1186122) (← links)
- Graphs with edge-preserving majority functions (Q1196742) (← links)
- Absolute retracts of split graphs (Q1339865) (← links)
- On the natural imprint function of a graph (Q1348742) (← links)
- Complexity of homomorphisms to direct products of graphs (Q1603497) (← links)
- On retracts, absolute retracts, and foldings in cographs (Q1749782) (← links)
- Algebra complexity problems involving graph homomorphism, semigroups and the constraint satisfaction problem (Q1869963) (← links)
- Incidence graphs of biacyclic hypergraphs (Q1923616) (← links)
- Graphs with a regular endomorphism monoid (Q1924914) (← links)
- Characterizing bipartite graphs which admit a \(k\)-NU polymorphism via absolute retracts (Q2053708) (← links)
- One more well-solved case of the multifacility location problem (Q2386213) (← links)
- On the extension of vertex maps to graph homomorphisms (Q2501538) (← links)
- A complete and equal computational complexity classification of compaction and retraction to all graphs with at most four vertices and some general results (Q2575831) (← links)
- Beyond Helly graphs: the diameter problem on absolute retracts (Q2672446) (← links)
- Wiener index and Steiner 3-Wiener index of graphs (Q5013455) (← links)
- Computational Complexity of Graph Partition under Vertex-Compaction to an Irreflexive Hexagon (Q5111286) (← links)
- Products of absolute retracts (Q5903896) (← links)
- Computational complexity relationship between compaction, vertex-compaction, and retraction (Q5915913) (← links)
- Graphs with \(G^p\)-connected medians (Q6120939) (← links)
- ABC(T)-graphs: an axiomatic characterization of the median procedure in graphs with connected and \(G^2\)-connected medians (Q6633522) (← links)
