Pages that link to "Item:Q1076682"
From MaRDI portal
The following pages link to A characterization of absolute retracts of n-chromatic graphs (Q1076682):
Displaying 14 items.
- Computational complexity of compaction to irreflexive cycles (Q596309) (← links)
- Hereditary modular graphs (Q1112068) (← links)
- Dismantling absolute retracts of reflexive graphs (Q1121291) (← 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 retracts, absolute retracts, and foldings in cographs (Q1749782) (← links)
- Absolute retracts of bipartite graphs (Q1820174) (← 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)
- 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)
