Pages that link to "Item:Q2575831"
From MaRDI portal
The following pages link to A complete and equal computational complexity classification of compaction and retraction to all graphs with at most four vertices and some general results (Q2575831):
Displaying 15 items.
- Algorithms for partition of some class of graphs under compaction and vertex-compaction (Q378212) (← links)
- The complexity of surjective homomorphism problems-a survey (Q444433) (← links)
- Computing vertex-surjective homomorphisms to partially reflexive trees (Q714844) (← links)
- Finding vertex-surjective graph homomorphisms (Q715053) (← links)
- On retracts, absolute retracts, and foldings in cographs (Q1749782) (← links)
- Surjective \(H\)-colouring: new hardness results (Q2011662) (← links)
- The computational complexity of disconnected cut and \(2 K_2\)-partition (Q2259853) (← links)
- On the sum-max graph partitioning problem (Q2453173) (← links)
- Computing Vertex-Surjective Homomorphisms to Partially Reflexive Trees (Q3007632) (← links)
- (Q3304148) (← links)
- (Q5002776) (← links)
- Retracting Graphs to Cycles (Q5091228) (← links)
- Computational Complexity of Graph Partition under Vertex-Compaction to an Irreflexive Hexagon (Q5111286) (← links)
- The Complexity of Counting Surjective Homomorphisms and Compactions (Q5232140) (← links)
- Computational complexity relationship between compaction, vertex-compaction, and retraction (Q5915913) (← links)
