The following pages link to Planar 3DM is NP-complete (Q3745303):
Displaying 12 items.
- Swapping Colored Tokens on Graphs (Q3449858) (← links)
- (Q4989372) (← links)
- Total vertex-edge domination in graphs: Complexity and algorithms (Q5057738) (← links)
- Star Partitions of Perfect Graphs (Q5167740) (← links)
- Open-independent, open-locating-dominating sets: structural aspects of some classes of graphs (Q5864729) (← links)
- Decomposing subcubic graphs into claws, paths or triangles (Q6056758) (← links)
- Algorithmic aspects of certified domination in graphs (Q6101494) (← links)
- Complexity, algorithmic, and computational aspects of a dial-a-ride type problem (Q6113356) (← links)
- Optimal embeddings of the exchanged hypercube and the dual-cube as vertex-induced subgraphs of the hypercube (Q6162041) (← links)
- The complexity of broadcasting in planar and decomposable graphs (Q6184371) (← links)
- On computing a center persistence diagram (Q6546596) (← links)
- Parameterizing path partitions (Q6664058) (← links)