Pages that link to "Item:Q450561"
From MaRDI portal
The following pages link to Computing role assignments of proper interval graphs in polynomial time (Q450561):
Displayed 7 items.
- Computing role assignments of split graphs (Q287443) (← links)
- Complexity of the game domination problem (Q313955) (← links)
- Parameterizing role coloring on forests (Q831825) (← links)
- Role coloring bipartite graphs (Q2081494) (← links)
- Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree (Q2348037) (← links)
- An algorithmic framework for locally constrained homomorphisms (Q6039418) (← links)
- Intersection graphs of non-crossing paths (Q6041577) (← links)