Pages that link to "Item:Q3087960"
From MaRDI portal
The following pages link to Algorithms for Partition of Some Class of Graphs under Compaction (Q3087960):
Displayed 11 items.
- Algorithms for partition of some class of graphs under compaction and vertex-compaction (Q378212) (← links)
- Obstructions to partitions of chordal graphs (Q383740) (← 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)
- The computational complexity of disconnected cut and \(2 K_2\)-partition (Q2259853) (← links)
- On the sum-max graph partitioning problem (Q2453173) (← links)
- Graph partitions with prescribed patterns (Q2509761) (← links)
- (Q5009627) (← links)
- Computational Complexity of Graph Partition under Vertex-Compaction to an Irreflexive Hexagon (Q5111286) (← links)
- Computational complexity relationship between compaction, vertex-compaction, and retraction (Q5915913) (← links)