Pages that link to "Item:Q5915913"
From MaRDI portal
The following pages link to Computational complexity relationship between compaction, vertex-compaction, and retraction (Q5915913):
Displaying 3 items.
- Algorithms for partition of some class of graphs under compaction and vertex-compaction (Q378212) (← 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)
- Computing and Combinatorics (Q4681200) (← links)