Pages that link to "Item:Q2714905"
From MaRDI portal
The following pages link to How hard is it to determine if a graph has a 2-role assignment? (Q2714905):
Displaying 18 items.
- Computing role assignments of split graphs (Q287443) (← links)
- Computing role assignments of chordal graphs (Q708211) (← links)
- A complete complexity classification of the role assignment problem (Q817773) (← links)
- Parameterizing role coloring on forests (Q831825) (← links)
- On the complexity of role colouring planar graphs, trees and cographs (Q891815) (← links)
- Comparing universal covers in polynomial time (Q987372) (← links)
- 2-role assignments on triangulated graphs. (Q1401397) (← links)
- Graph coloring, minimum-diameter partitioning, and the analysis of confusion matrices (Q1775813) (← links)
- Role coloring bipartite graphs (Q2081494) (← links)
- Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree (Q2348037) (← links)
- Locally constrained graph homomorphisms and equitable partitions (Q2427537) (← links)
- Evaluating the quality of image matrices in blockmodeling (Q2516355) (← links)
- Comparing Universal Covers in Polynomial Time (Q3503635) (← links)
- Edge homogeneous colorings (Q5033097) (← links)
- Making Role Assignment Feasible: A Polynomial-Time Algorithm for Computing Ecological Colorings (Q5302046) (← links)
- Homogeneous colourings of graphs (Q5878484) (← links)
- The role assignment model nearly fits most social networks (Q5939411) (← links)
- An algorithmic framework for locally constrained homomorphisms (Q6499010) (← links)
