Pages that link to "Item:Q5111286"
From MaRDI portal
The following pages link to Computational Complexity of Graph Partition under Vertex-Compaction to an Irreflexive Hexagon (Q5111286):
Displaying 5 items.
- Computational complexity of compaction to irreflexive cycles (Q596309) (← links)
- Coloring problems on bipartite graphs of small diameter (Q831342) (← links)
- Surjective \texttt{H}-colouring over reflexive digraphs (Q3304148) (← links)
- Computational complexity relationship between compaction, vertex-compaction, and retraction (Q5915913) (← links)
- Constraint satisfaction problem: what makes the problem easy (Q6119674) (← links)