Pages that link to "Item:Q3030858"

The following pages link to Absolute Retracts and Varieties of Reflexive Graphs (Q3030858):

Displaying 42 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)
• Retracts of strong products of graphs (Q686295) (← links)
• Two remarks on retracts of graph products (Q686296) (← links)
• Retract rigid Cartesian products of graphs (Q912867) (← links)
• Absolute retracts and varieties generated by chordal graphs (Q968425) (← links)
• A surprising permanence of old motivations (a not-so-rigid story) (Q1045032) (← links)
• A retraction problem in graph theory (Q1073052) (← links)
• A characterization of absolute retracts of n-chromatic graphs (Q1076682) (← links)
• Holes in ordered sets (Q1084421) (← links)
• Dismantling absolute retracts of reflexive graphs (Q1121291) (← links)
• List homomorphisms to reflexive graphs (Q1127870) (← links)
• Graphs with edge-preserving majority functions (Q1196742) (← links)
• A new fixed point approach for stable networks and stable marriages (Q1201153) (← links)
• Absolute retracts of split graphs (Q1339865) (← links)
• On the natural imprint function of a graph (Q1348742) (← links)
• Injective envelope of graphs and transition systems (Q1584442) (← links)
• Absolute retracts of bipartite graphs (Q1820174) (← links)
• Obituary: Ivan Rival (Q1826506) (← links)
• Homomorphically full graphs (Q1917297) (← links)
• Reflexive graphs with near unanimity but no semilattice polymorphisms (Q1991407) (← links)
• The algebra of metric betweenness. I: Subdirect representation and retraction (Q2372427) (← links)
• Semilattice polymorphisms and chordal graphs (Q2441663) (← links)
• Retractions onto series-parallel posets (Q2483392) (← links)
• On the extension of vertex maps to graph homomorphisms (Q2501538) (← links)
• Building blocks for the variety of absolute retracts (Q2502901) (← links)
• Graph partitions with prescribed patterns (Q2509761) (← 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)
• Weakly Modular Graphs and Nonpositive Curvature (Q3380549) (← links)
• First-order Definable Retraction Problems for Posets and Reflexive Graphs (Q3437257) (← links)
• (Q3730636) (← links)
• Minimal extensions of graphs to absolute retracts (Q3794219) (← links)
• Retracts of graphs (Q3994353) (← links)
• Product graph representations (Q4020705) (← links)
• Retract‐collapsible graphs and invariant subgraph properties (Q4320464) (← links)
• Computational Complexity of Graph Partition under Vertex-Compaction to an Irreflexive Hexagon (Q5111286) (← links)
• Minimum Violation Vertex Maps and Their Applications to Cut Problems (Q5138968) (← links)
• Computational complexity relationship between compaction, vertex-compaction, and retraction (Q5915913) (← links)
• Graphs with \(G^p\)-connected medians (Q6120939) (← links)
• Helly groups (Q6656658) (← links)